./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/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 17769653fcc1793cb44568ec45f15628df5f1ace ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:44:18,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:44:18,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:44:18,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:44:18,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:44:18,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:44:18,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:44:18,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:44:18,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:44:18,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:44:18,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:44:18,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:44:18,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:44:18,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:44:18,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:44:18,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:44:18,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:44:18,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:44:18,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:44:18,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:44:18,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:44:18,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:44:18,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:44:18,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:44:18,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:44:18,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:44:18,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:44:18,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:44:18,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:44:18,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:44:18,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:44:18,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:44:18,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:44:18,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:44:18,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:44:18,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:44:18,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:44:18,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:44:18,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:44:18,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:44:18,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:44:18,544 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:44:18,570 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:44:18,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:44:18,581 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:44:18,581 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:44:18,582 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:44:18,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:44:18,582 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:44:18,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:44:18,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:44:18,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:44:18,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:44:18,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:44:18,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:44:18,584 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:44:18,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:44:18,584 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:44:18,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:44:18,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:44:18,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:44:18,585 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:44:18,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:44:18,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:44:18,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:44:18,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:44:18,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:44:18,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:44:18,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:44:18,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:44:18,587 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_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/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 -> 17769653fcc1793cb44568ec45f15628df5f1ace [2019-11-15 20:44:18,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:44:18,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:44:18,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:44:18,634 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:44:18,634 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:44:18,635 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/../../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-11-15 20:44:18,687 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/data/74f96a12f/161694ce180044d8a0f795f00e42823d/FLAG1b71e3944 [2019-11-15 20:44:19,065 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:44:19,065 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-11-15 20:44:19,076 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/data/74f96a12f/161694ce180044d8a0f795f00e42823d/FLAG1b71e3944 [2019-11-15 20:44:19,431 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/data/74f96a12f/161694ce180044d8a0f795f00e42823d [2019-11-15 20:44:19,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:44:19,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:44:19,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:44:19,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:44:19,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:44:19,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:44:19" (1/1) ... [2019-11-15 20:44:19,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a7b909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:19, skipping insertion in model container [2019-11-15 20:44:19,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:44:19" (1/1) ... [2019-11-15 20:44:19,451 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:44:19,505 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:44:19,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:44:19,894 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:44:19,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:44:20,010 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:44:20,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:20 WrapperNode [2019-11-15 20:44:20,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:44:20,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:44:20,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:44:20,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:44:20,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:20" (1/1) ... [2019-11-15 20:44:20,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:20" (1/1) ... [2019-11-15 20:44:20,106 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:44:20,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:44:20,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:44:20,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:44:20,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:20" (1/1) ... [2019-11-15 20:44:20,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:20" (1/1) ... [2019-11-15 20:44:20,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:20" (1/1) ... [2019-11-15 20:44:20,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:20" (1/1) ... [2019-11-15 20:44:20,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:20" (1/1) ... [2019-11-15 20:44:20,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:20" (1/1) ... [2019-11-15 20:44:20,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:20" (1/1) ... [2019-11-15 20:44:20,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:44:20,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:44:20,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:44:20,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:44:20,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/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-15 20:44:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:44:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:44:21,067 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:44:21,068 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 20:44:21,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:44:21 BoogieIcfgContainer [2019-11-15 20:44:21,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:44:21,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:44:21,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:44:21,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:44:21,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:44:19" (1/3) ... [2019-11-15 20:44:21,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a465cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:44:21, skipping insertion in model container [2019-11-15 20:44:21,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:20" (2/3) ... [2019-11-15 20:44:21,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a465cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:44:21, skipping insertion in model container [2019-11-15 20:44:21,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:44:21" (3/3) ... [2019-11-15 20:44:21,075 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2019-11-15 20:44:21,084 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:44:21,090 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:44:21,100 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:44:21,125 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:44:21,125 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:44:21,125 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:44:21,125 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:44:21,125 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:44:21,125 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:44:21,125 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:44:21,126 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:44:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2019-11-15 20:44:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-15 20:44:21,155 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:21,156 INFO L380 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] [2019-11-15 20:44:21,158 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:21,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:21,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1067704148, now seen corresponding path program 1 times [2019-11-15 20:44:21,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:21,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319118432] [2019-11-15 20:44:21,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:21,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:21,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:21,340 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-15 20:44:21,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319118432] [2019-11-15 20:44:21,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:21,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:44:21,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783737413] [2019-11-15 20:44:21,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:44:21,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:21,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:44:21,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:44:21,363 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2019-11-15 20:44:21,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:21,855 INFO L93 Difference]: Finished difference Result 284 states and 554 transitions. [2019-11-15 20:44:21,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:44:21,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-15 20:44:21,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:21,875 INFO L225 Difference]: With dead ends: 284 [2019-11-15 20:44:21,875 INFO L226 Difference]: Without dead ends: 141 [2019-11-15 20:44:21,880 INFO L600 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-15 20:44:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-15 20:44:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-11-15 20:44:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:44:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-11-15 20:44:21,950 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 139 [2019-11-15 20:44:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:21,950 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-11-15 20:44:21,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:44:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-11-15 20:44:21,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-15 20:44:21,961 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:21,963 INFO L380 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] [2019-11-15 20:44:21,963 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:21,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:21,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1752580255, now seen corresponding path program 1 times [2019-11-15 20:44:21,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:21,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593905175] [2019-11-15 20:44:21,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:21,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:21,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:44:22,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593905175] [2019-11-15 20:44:22,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:22,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:44:22,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249920045] [2019-11-15 20:44:22,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:44:22,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:22,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:44:22,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:44:22,100 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 3 states. [2019-11-15 20:44:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:22,735 INFO L93 Difference]: Finished difference Result 406 states and 605 transitions. [2019-11-15 20:44:22,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:44:22,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-15 20:44:22,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:22,738 INFO L225 Difference]: With dead ends: 406 [2019-11-15 20:44:22,738 INFO L226 Difference]: Without dead ends: 273 [2019-11-15 20:44:22,740 INFO L600 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-15 20:44:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-15 20:44:22,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2019-11-15 20:44:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-11-15 20:44:22,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 341 transitions. [2019-11-15 20:44:22,763 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 341 transitions. Word has length 139 [2019-11-15 20:44:22,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:22,763 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 341 transitions. [2019-11-15 20:44:22,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:44:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 341 transitions. [2019-11-15 20:44:22,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-15 20:44:22,766 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:22,766 INFO L380 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] [2019-11-15 20:44:22,766 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:22,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:22,767 INFO L82 PathProgramCache]: Analyzing trace with hash 2041942551, now seen corresponding path program 1 times [2019-11-15 20:44:22,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:22,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876107199] [2019-11-15 20:44:22,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:22,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:22,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:25,309 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-15 20:44:25,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876107199] [2019-11-15 20:44:25,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:25,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-11-15 20:44:25,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106668994] [2019-11-15 20:44:25,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-15 20:44:25,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:25,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-15 20:44:25,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2094, Invalid=2598, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 20:44:25,315 INFO L87 Difference]: Start difference. First operand 273 states and 341 transitions. Second operand 69 states. [2019-11-15 20:44:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:26,055 INFO L93 Difference]: Finished difference Result 402 states and 470 transitions. [2019-11-15 20:44:26,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:44:26,056 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 139 [2019-11-15 20:44:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:26,058 INFO L225 Difference]: With dead ends: 402 [2019-11-15 20:44:26,058 INFO L226 Difference]: Without dead ends: 267 [2019-11-15 20:44:26,061 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2094, Invalid=2598, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 20:44:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-11-15 20:44:26,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2019-11-15 20:44:26,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-11-15 20:44:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 332 transitions. [2019-11-15 20:44:26,096 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 332 transitions. Word has length 139 [2019-11-15 20:44:26,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:26,099 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 332 transitions. [2019-11-15 20:44:26,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-15 20:44:26,099 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 332 transitions. [2019-11-15 20:44:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-15 20:44:26,102 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:26,103 INFO L380 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] [2019-11-15 20:44:26,103 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:26,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1527946145, now seen corresponding path program 1 times [2019-11-15 20:44:26,104 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:26,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483071306] [2019-11-15 20:44:26,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:26,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:26,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:28,661 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-15 20:44:28,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483071306] [2019-11-15 20:44:28,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:28,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-11-15 20:44:28,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951705176] [2019-11-15 20:44:28,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-15 20:44:28,664 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:28,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-15 20:44:28,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2036, Invalid=2656, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 20:44:28,669 INFO L87 Difference]: Start difference. First operand 267 states and 332 transitions. Second operand 69 states. [2019-11-15 20:44:29,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:29,362 INFO L93 Difference]: Finished difference Result 394 states and 459 transitions. [2019-11-15 20:44:29,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:44:29,363 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 139 [2019-11-15 20:44:29,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:29,364 INFO L225 Difference]: With dead ends: 394 [2019-11-15 20:44:29,365 INFO L226 Difference]: Without dead ends: 265 [2019-11-15 20:44:29,367 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2036, Invalid=2656, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 20:44:29,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-11-15 20:44:29,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2019-11-15 20:44:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-11-15 20:44:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 329 transitions. [2019-11-15 20:44:29,381 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 329 transitions. Word has length 139 [2019-11-15 20:44:29,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:29,382 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 329 transitions. [2019-11-15 20:44:29,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-15 20:44:29,382 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 329 transitions. [2019-11-15 20:44:29,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-15 20:44:29,384 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:29,384 INFO L380 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] [2019-11-15 20:44:29,384 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:29,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:29,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1089183555, now seen corresponding path program 1 times [2019-11-15 20:44:29,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:29,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590225322] [2019-11-15 20:44:29,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:29,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:29,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:31,223 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-15 20:44:31,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590225322] [2019-11-15 20:44:31,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:31,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-11-15 20:44:31,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892413725] [2019-11-15 20:44:31,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-15 20:44:31,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:31,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-15 20:44:31,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1874, Invalid=2818, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 20:44:31,227 INFO L87 Difference]: Start difference. First operand 265 states and 329 transitions. Second operand 69 states. [2019-11-15 20:44:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:32,168 INFO L93 Difference]: Finished difference Result 386 states and 450 transitions. [2019-11-15 20:44:32,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:44:32,168 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 139 [2019-11-15 20:44:32,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:32,170 INFO L225 Difference]: With dead ends: 386 [2019-11-15 20:44:32,170 INFO L226 Difference]: Without dead ends: 259 [2019-11-15 20:44:32,172 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1874, Invalid=2818, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 20:44:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-15 20:44:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-11-15 20:44:32,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-15 20:44:32,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 320 transitions. [2019-11-15 20:44:32,186 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 320 transitions. Word has length 139 [2019-11-15 20:44:32,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:32,187 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 320 transitions. [2019-11-15 20:44:32,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-15 20:44:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 320 transitions. [2019-11-15 20:44:32,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-15 20:44:32,189 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:32,189 INFO L380 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] [2019-11-15 20:44:32,189 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:32,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:32,190 INFO L82 PathProgramCache]: Analyzing trace with hash -41763050, now seen corresponding path program 1 times [2019-11-15 20:44:32,190 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:32,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250929475] [2019-11-15 20:44:32,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:32,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:32,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:33,954 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-15 20:44:33,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250929475] [2019-11-15 20:44:33,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:33,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-11-15 20:44:33,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828557044] [2019-11-15 20:44:33,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-15 20:44:33,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:33,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-15 20:44:33,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1730, Invalid=2962, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 20:44:33,958 INFO L87 Difference]: Start difference. First operand 259 states and 320 transitions. Second operand 69 states. [2019-11-15 20:44:35,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:35,056 INFO L93 Difference]: Finished difference Result 374 states and 435 transitions. [2019-11-15 20:44:35,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:44:35,056 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 139 [2019-11-15 20:44:35,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:35,058 INFO L225 Difference]: With dead ends: 374 [2019-11-15 20:44:35,058 INFO L226 Difference]: Without dead ends: 253 [2019-11-15 20:44:35,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1730, Invalid=2962, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 20:44:35,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-15 20:44:35,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2019-11-15 20:44:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-15 20:44:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 311 transitions. [2019-11-15 20:44:35,069 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 311 transitions. Word has length 139 [2019-11-15 20:44:35,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:35,069 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 311 transitions. [2019-11-15 20:44:35,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-15 20:44:35,070 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 311 transitions. [2019-11-15 20:44:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-15 20:44:35,071 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:35,072 INFO L380 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] [2019-11-15 20:44:35,072 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:35,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:35,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1153200357, now seen corresponding path program 1 times [2019-11-15 20:44:35,073 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:35,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091212680] [2019-11-15 20:44:35,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:35,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:35,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:36,755 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-15 20:44:36,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091212680] [2019-11-15 20:44:36,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:36,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-11-15 20:44:36,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413427464] [2019-11-15 20:44:36,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-15 20:44:36,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:36,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-15 20:44:36,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1644, Invalid=3048, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 20:44:36,759 INFO L87 Difference]: Start difference. First operand 253 states and 311 transitions. Second operand 69 states. [2019-11-15 20:44:37,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:37,859 INFO L93 Difference]: Finished difference Result 364 states and 422 transitions. [2019-11-15 20:44:37,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 20:44:37,859 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 139 [2019-11-15 20:44:37,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:37,861 INFO L225 Difference]: With dead ends: 364 [2019-11-15 20:44:37,861 INFO L226 Difference]: Without dead ends: 249 [2019-11-15 20:44:37,863 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1644, Invalid=3048, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 20:44:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-11-15 20:44:37,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2019-11-15 20:44:37,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-11-15 20:44:37,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 305 transitions. [2019-11-15 20:44:37,872 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 305 transitions. Word has length 139 [2019-11-15 20:44:37,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:37,872 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 305 transitions. [2019-11-15 20:44:37,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-15 20:44:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 305 transitions. [2019-11-15 20:44:37,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-15 20:44:37,874 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:37,875 INFO L380 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] [2019-11-15 20:44:37,875 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:37,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:37,875 INFO L82 PathProgramCache]: Analyzing trace with hash -717830785, now seen corresponding path program 1 times [2019-11-15 20:44:37,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:37,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789956080] [2019-11-15 20:44:37,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:37,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:37,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:39,644 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-15 20:44:39,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789956080] [2019-11-15 20:44:39,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:39,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-11-15 20:44:39,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268169625] [2019-11-15 20:44:39,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-15 20:44:39,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:39,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-15 20:44:39,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1496, Invalid=3196, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 20:44:39,647 INFO L87 Difference]: Start difference. First operand 249 states and 305 transitions. Second operand 69 states. [2019-11-15 20:44:41,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:41,073 INFO L93 Difference]: Finished difference Result 352 states and 408 transitions. [2019-11-15 20:44:41,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 20:44:41,073 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 139 [2019-11-15 20:44:41,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:41,075 INFO L225 Difference]: With dead ends: 352 [2019-11-15 20:44:41,075 INFO L226 Difference]: Without dead ends: 241 [2019-11-15 20:44:41,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1496, Invalid=3196, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 20:44:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-15 20:44:41,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-15 20:44:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-15 20:44:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 293 transitions. [2019-11-15 20:44:41,084 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 293 transitions. Word has length 139 [2019-11-15 20:44:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:41,084 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 293 transitions. [2019-11-15 20:44:41,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-15 20:44:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 293 transitions. [2019-11-15 20:44:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-15 20:44:41,086 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:41,086 INFO L380 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] [2019-11-15 20:44:41,087 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:41,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:41,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1738769551, now seen corresponding path program 1 times [2019-11-15 20:44:41,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:41,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167098834] [2019-11-15 20:44:41,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:41,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:41,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:43,046 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-15 20:44:43,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167098834] [2019-11-15 20:44:43,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:43,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2019-11-15 20:44:43,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448003876] [2019-11-15 20:44:43,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-11-15 20:44:43,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:43,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-11-15 20:44:43,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-11-15 20:44:43,050 INFO L87 Difference]: Start difference. First operand 241 states and 293 transitions. Second operand 70 states. [2019-11-15 20:44:48,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:48,698 INFO L93 Difference]: Finished difference Result 552 states and 621 transitions. [2019-11-15 20:44:48,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-11-15 20:44:48,700 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 139 [2019-11-15 20:44:48,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:48,702 INFO L225 Difference]: With dead ends: 552 [2019-11-15 20:44:48,702 INFO L226 Difference]: Without dead ends: 449 [2019-11-15 20:44:48,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-11-15 20:44:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-11-15 20:44:48,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 448. [2019-11-15 20:44:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-11-15 20:44:48,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 466 transitions. [2019-11-15 20:44:48,723 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 466 transitions. Word has length 139 [2019-11-15 20:44:48,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:48,723 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 466 transitions. [2019-11-15 20:44:48,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-11-15 20:44:48,724 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 466 transitions. [2019-11-15 20:44:48,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-15 20:44:48,725 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:48,725 INFO L380 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] [2019-11-15 20:44:48,725 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:48,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:48,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1420118316, now seen corresponding path program 1 times [2019-11-15 20:44:48,728 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:48,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798946632] [2019-11-15 20:44:48,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:48,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:48,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:44:50,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798946632] [2019-11-15 20:44:50,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318176578] [2019-11-15 20:44:50,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/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-15 20:44:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:50,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 70 conjunts are in the unsatisfiable core [2019-11-15 20:44:50,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:44:51,050 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:44:51,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2019-11-15 20:44:51,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971927477] [2019-11-15 20:44:51,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-11-15 20:44:51,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:51,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-11-15 20:44:51,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-11-15 20:44:51,054 INFO L87 Difference]: Start difference. First operand 448 states and 466 transitions. Second operand 71 states. [2019-11-15 20:44:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:53,740 INFO L93 Difference]: Finished difference Result 454 states and 472 transitions. [2019-11-15 20:44:53,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-11-15 20:44:53,741 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 141 [2019-11-15 20:44:53,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:44:53,744 INFO L225 Difference]: With dead ends: 454 [2019-11-15 20:44:53,744 INFO L226 Difference]: Without dead ends: 451 [2019-11-15 20:44:53,745 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-11-15 20:44:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-15 20:44:53,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 450. [2019-11-15 20:44:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-11-15 20:44:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 468 transitions. [2019-11-15 20:44:53,760 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 468 transitions. Word has length 141 [2019-11-15 20:44:53,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:44:53,761 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 468 transitions. [2019-11-15 20:44:53,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-11-15 20:44:53,761 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 468 transitions. [2019-11-15 20:44:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-15 20:44:53,763 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:44:53,763 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 20:44:53,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:44:53,966 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:44:53,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:53,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1058373006, now seen corresponding path program 2 times [2019-11-15 20:44:53,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:53,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620976732] [2019-11-15 20:44:53,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:53,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:53,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:44:56,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620976732] [2019-11-15 20:44:56,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624416934] [2019-11-15 20:44:56,138 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/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-15 20:44:56,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:44:56,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:44:56,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-15 20:44:56,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:44:56,304 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:44:56,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2019-11-15 20:44:56,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054920831] [2019-11-15 20:44:56,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-11-15 20:44:56,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:56,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-11-15 20:44:56,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-11-15 20:44:56,307 INFO L87 Difference]: Start difference. First operand 450 states and 468 transitions. Second operand 72 states. [2019-11-15 20:45:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:01,629 INFO L93 Difference]: Finished difference Result 456 states and 474 transitions. [2019-11-15 20:45:01,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-11-15 20:45:01,630 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 143 [2019-11-15 20:45:01,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:01,632 INFO L225 Difference]: With dead ends: 456 [2019-11-15 20:45:01,632 INFO L226 Difference]: Without dead ends: 453 [2019-11-15 20:45:01,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-11-15 20:45:01,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-15 20:45:01,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 452. [2019-11-15 20:45:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-15 20:45:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 470 transitions. [2019-11-15 20:45:01,648 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 470 transitions. Word has length 143 [2019-11-15 20:45:01,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:01,648 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 470 transitions. [2019-11-15 20:45:01,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-11-15 20:45:01,649 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 470 transitions. [2019-11-15 20:45:01,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-15 20:45:01,650 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:01,651 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:01,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:01,855 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:01,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:01,855 INFO L82 PathProgramCache]: Analyzing trace with hash -818315832, now seen corresponding path program 3 times [2019-11-15 20:45:01,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:01,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217210847] [2019-11-15 20:45:01,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:01,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:01,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:04,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217210847] [2019-11-15 20:45:04,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462430186] [2019-11-15 20:45:04,383 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/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-15 20:45:04,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 20:45:04,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:45:04,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 72 conjunts are in the unsatisfiable core [2019-11-15 20:45:04,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:04,566 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:04,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2019-11-15 20:45:04,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255703821] [2019-11-15 20:45:04,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-11-15 20:45:04,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:04,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-11-15 20:45:04,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-11-15 20:45:04,569 INFO L87 Difference]: Start difference. First operand 452 states and 470 transitions. Second operand 73 states. [2019-11-15 20:45:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:09,762 INFO L93 Difference]: Finished difference Result 458 states and 476 transitions. [2019-11-15 20:45:09,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-11-15 20:45:09,763 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 145 [2019-11-15 20:45:09,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:09,765 INFO L225 Difference]: With dead ends: 458 [2019-11-15 20:45:09,765 INFO L226 Difference]: Without dead ends: 455 [2019-11-15 20:45:09,765 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-11-15 20:45:09,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-15 20:45:09,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 454. [2019-11-15 20:45:09,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-11-15 20:45:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 472 transitions. [2019-11-15 20:45:09,776 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 472 transitions. Word has length 145 [2019-11-15 20:45:09,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:09,777 INFO L462 AbstractCegarLoop]: Abstraction has 454 states and 472 transitions. [2019-11-15 20:45:09,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-11-15 20:45:09,777 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 472 transitions. [2019-11-15 20:45:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-15 20:45:09,779 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:09,779 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:09,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:09,982 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:09,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:09,983 INFO L82 PathProgramCache]: Analyzing trace with hash -430024830, now seen corresponding path program 4 times [2019-11-15 20:45:09,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:09,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850234715] [2019-11-15 20:45:09,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:09,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:09,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:12,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850234715] [2019-11-15 20:45:12,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441086366] [2019-11-15 20:45:12,249 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:12,335 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:45:12,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:45:12,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-15 20:45:12,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:12,385 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:12,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2019-11-15 20:45:12,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493972046] [2019-11-15 20:45:12,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-11-15 20:45:12,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:12,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-11-15 20:45:12,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-11-15 20:45:12,388 INFO L87 Difference]: Start difference. First operand 454 states and 472 transitions. Second operand 74 states. [2019-11-15 20:45:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:17,416 INFO L93 Difference]: Finished difference Result 460 states and 478 transitions. [2019-11-15 20:45:17,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-11-15 20:45:17,416 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 147 [2019-11-15 20:45:17,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:17,418 INFO L225 Difference]: With dead ends: 460 [2019-11-15 20:45:17,418 INFO L226 Difference]: Without dead ends: 457 [2019-11-15 20:45:17,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-11-15 20:45:17,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-11-15 20:45:17,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 456. [2019-11-15 20:45:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-15 20:45:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 474 transitions. [2019-11-15 20:45:17,429 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 474 transitions. Word has length 147 [2019-11-15 20:45:17,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:17,430 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 474 transitions. [2019-11-15 20:45:17,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-11-15 20:45:17,430 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 474 transitions. [2019-11-15 20:45:17,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-15 20:45:17,431 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:17,432 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:17,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:17,635 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:17,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:17,635 INFO L82 PathProgramCache]: Analyzing trace with hash -944526660, now seen corresponding path program 5 times [2019-11-15 20:45:17,636 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:17,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572008993] [2019-11-15 20:45:17,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:17,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:17,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:20,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572008993] [2019-11-15 20:45:20,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507607641] [2019-11-15 20:45:20,001 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:20,091 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-15 20:45:20,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:45:20,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 74 conjunts are in the unsatisfiable core [2019-11-15 20:45:20,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:20,135 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:20,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2019-11-15 20:45:20,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742230786] [2019-11-15 20:45:20,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-11-15 20:45:20,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:20,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-11-15 20:45:20,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-11-15 20:45:20,138 INFO L87 Difference]: Start difference. First operand 456 states and 474 transitions. Second operand 75 states. [2019-11-15 20:45:22,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:22,483 INFO L93 Difference]: Finished difference Result 462 states and 480 transitions. [2019-11-15 20:45:22,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-11-15 20:45:22,484 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 149 [2019-11-15 20:45:22,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:22,486 INFO L225 Difference]: With dead ends: 462 [2019-11-15 20:45:22,486 INFO L226 Difference]: Without dead ends: 459 [2019-11-15 20:45:22,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-11-15 20:45:22,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-11-15 20:45:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 458. [2019-11-15 20:45:22,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-11-15 20:45:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 476 transitions. [2019-11-15 20:45:22,498 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 476 transitions. Word has length 149 [2019-11-15 20:45:22,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:22,499 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 476 transitions. [2019-11-15 20:45:22,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-11-15 20:45:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 476 transitions. [2019-11-15 20:45:22,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-15 20:45:22,500 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:22,501 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:22,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:22,704 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:22,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:22,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1459546250, now seen corresponding path program 6 times [2019-11-15 20:45:22,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:22,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311640456] [2019-11-15 20:45:22,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:22,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:22,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:24,914 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:24,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311640456] [2019-11-15 20:45:24,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559068255] [2019-11-15 20:45:24,915 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:25,017 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-15 20:45:25,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:45:25,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 75 conjunts are in the unsatisfiable core [2019-11-15 20:45:25,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:25,061 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:25,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2019-11-15 20:45:25,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362733371] [2019-11-15 20:45:25,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-11-15 20:45:25,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:25,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-11-15 20:45:25,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-11-15 20:45:25,063 INFO L87 Difference]: Start difference. First operand 458 states and 476 transitions. Second operand 76 states. [2019-11-15 20:45:30,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:30,154 INFO L93 Difference]: Finished difference Result 464 states and 482 transitions. [2019-11-15 20:45:30,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-11-15 20:45:30,154 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 151 [2019-11-15 20:45:30,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:30,157 INFO L225 Difference]: With dead ends: 464 [2019-11-15 20:45:30,157 INFO L226 Difference]: Without dead ends: 461 [2019-11-15 20:45:30,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-11-15 20:45:30,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-11-15 20:45:30,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 460. [2019-11-15 20:45:30,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-11-15 20:45:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 478 transitions. [2019-11-15 20:45:30,168 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 478 transitions. Word has length 151 [2019-11-15 20:45:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:30,168 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 478 transitions. [2019-11-15 20:45:30,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-11-15 20:45:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 478 transitions. [2019-11-15 20:45:30,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-15 20:45:30,170 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:30,171 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:30,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:30,374 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:30,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:30,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1822834096, now seen corresponding path program 7 times [2019-11-15 20:45:30,375 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:30,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198419661] [2019-11-15 20:45:30,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:30,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:30,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:33,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198419661] [2019-11-15 20:45:33,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914717063] [2019-11-15 20:45:33,212 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:33,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 76 conjunts are in the unsatisfiable core [2019-11-15 20:45:33,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:33,380 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:33,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2019-11-15 20:45:33,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753685878] [2019-11-15 20:45:33,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-11-15 20:45:33,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:33,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-11-15 20:45:33,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-11-15 20:45:33,383 INFO L87 Difference]: Start difference. First operand 460 states and 478 transitions. Second operand 77 states. [2019-11-15 20:45:38,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:38,583 INFO L93 Difference]: Finished difference Result 466 states and 484 transitions. [2019-11-15 20:45:38,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-11-15 20:45:38,584 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 153 [2019-11-15 20:45:38,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:38,586 INFO L225 Difference]: With dead ends: 466 [2019-11-15 20:45:38,587 INFO L226 Difference]: Without dead ends: 463 [2019-11-15 20:45:38,588 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-11-15 20:45:38,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-11-15 20:45:38,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 462. [2019-11-15 20:45:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-11-15 20:45:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 480 transitions. [2019-11-15 20:45:38,599 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 480 transitions. Word has length 153 [2019-11-15 20:45:38,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:38,600 INFO L462 AbstractCegarLoop]: Abstraction has 462 states and 480 transitions. [2019-11-15 20:45:38,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-11-15 20:45:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 480 transitions. [2019-11-15 20:45:38,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-15 20:45:38,602 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:38,602 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:38,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:38,805 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:38,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:38,806 INFO L82 PathProgramCache]: Analyzing trace with hash -610615958, now seen corresponding path program 8 times [2019-11-15 20:45:38,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:38,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919190338] [2019-11-15 20:45:38,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:38,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:38,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:41,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919190338] [2019-11-15 20:45:41,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9764289] [2019-11-15 20:45:41,434 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:41,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:45:41,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:45:41,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 77 conjunts are in the unsatisfiable core [2019-11-15 20:45:41,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:41,586 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:41,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2019-11-15 20:45:41,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512435956] [2019-11-15 20:45:41,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-11-15 20:45:41,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:41,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-11-15 20:45:41,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-11-15 20:45:41,588 INFO L87 Difference]: Start difference. First operand 462 states and 480 transitions. Second operand 78 states. [2019-11-15 20:45:46,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:46,753 INFO L93 Difference]: Finished difference Result 468 states and 486 transitions. [2019-11-15 20:45:46,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-11-15 20:45:46,754 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 155 [2019-11-15 20:45:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:46,755 INFO L225 Difference]: With dead ends: 468 [2019-11-15 20:45:46,756 INFO L226 Difference]: Without dead ends: 465 [2019-11-15 20:45:46,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-11-15 20:45:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-11-15 20:45:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 464. [2019-11-15 20:45:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-11-15 20:45:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 482 transitions. [2019-11-15 20:45:46,766 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 482 transitions. Word has length 155 [2019-11-15 20:45:46,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:46,766 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 482 transitions. [2019-11-15 20:45:46,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-11-15 20:45:46,767 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 482 transitions. [2019-11-15 20:45:46,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-15 20:45:46,768 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:46,768 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:46,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:46,973 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:46,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:46,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1601058468, now seen corresponding path program 9 times [2019-11-15 20:45:46,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:46,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40810067] [2019-11-15 20:45:46,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:46,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:46,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:49,695 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:49,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40810067] [2019-11-15 20:45:49,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921144442] [2019-11-15 20:45:49,696 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:49,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-15 20:45:49,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:45:49,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 78 conjunts are in the unsatisfiable core [2019-11-15 20:45:49,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:49,876 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:49,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2019-11-15 20:45:49,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265117506] [2019-11-15 20:45:49,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-11-15 20:45:49,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:49,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-11-15 20:45:49,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-11-15 20:45:49,879 INFO L87 Difference]: Start difference. First operand 464 states and 482 transitions. Second operand 79 states. [2019-11-15 20:45:55,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:55,048 INFO L93 Difference]: Finished difference Result 470 states and 488 transitions. [2019-11-15 20:45:55,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-11-15 20:45:55,049 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 157 [2019-11-15 20:45:55,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:55,051 INFO L225 Difference]: With dead ends: 470 [2019-11-15 20:45:55,051 INFO L226 Difference]: Without dead ends: 467 [2019-11-15 20:45:55,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-11-15 20:45:55,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-11-15 20:45:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 466. [2019-11-15 20:45:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-11-15 20:45:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 484 transitions. [2019-11-15 20:45:55,062 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 484 transitions. Word has length 157 [2019-11-15 20:45:55,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:55,063 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 484 transitions. [2019-11-15 20:45:55,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-11-15 20:45:55,063 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 484 transitions. [2019-11-15 20:45:55,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-15 20:45:55,064 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:55,065 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:45:55,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:55,268 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:55,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:55,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1011370334, now seen corresponding path program 10 times [2019-11-15 20:45:55,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:55,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802085708] [2019-11-15 20:45:55,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:55,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:55,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:57,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802085708] [2019-11-15 20:45:57,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908507455] [2019-11-15 20:45:57,714 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:57,827 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:45:57,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:45:57,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 79 conjunts are in the unsatisfiable core [2019-11-15 20:45:57,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:57,871 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:57,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2019-11-15 20:45:57,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247540161] [2019-11-15 20:45:57,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-11-15 20:45:57,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:57,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-11-15 20:45:57,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-11-15 20:45:57,874 INFO L87 Difference]: Start difference. First operand 466 states and 484 transitions. Second operand 80 states. [2019-11-15 20:46:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:00,297 INFO L93 Difference]: Finished difference Result 472 states and 490 transitions. [2019-11-15 20:46:00,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-11-15 20:46:00,297 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 159 [2019-11-15 20:46:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:00,299 INFO L225 Difference]: With dead ends: 472 [2019-11-15 20:46:00,299 INFO L226 Difference]: Without dead ends: 469 [2019-11-15 20:46:00,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-11-15 20:46:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-11-15 20:46:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 468. [2019-11-15 20:46:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-11-15 20:46:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 486 transitions. [2019-11-15 20:46:00,310 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 486 transitions. Word has length 159 [2019-11-15 20:46:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:00,310 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 486 transitions. [2019-11-15 20:46:00,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-11-15 20:46:00,311 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 486 transitions. [2019-11-15 20:46:00,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-15 20:46:00,312 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:00,312 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:46:00,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:00,518 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:00,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:00,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1256756632, now seen corresponding path program 11 times [2019-11-15 20:46:00,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:00,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169049280] [2019-11-15 20:46:00,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:00,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:00,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,140 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:03,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169049280] [2019-11-15 20:46:03,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450148678] [2019-11-15 20:46:03,141 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:03,260 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-15 20:46:03,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:46:03,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 80 conjunts are in the unsatisfiable core [2019-11-15 20:46:03,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:03,303 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:03,304 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:46:03,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2019-11-15 20:46:03,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770956751] [2019-11-15 20:46:03,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-11-15 20:46:03,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:03,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-11-15 20:46:03,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-11-15 20:46:03,307 INFO L87 Difference]: Start difference. First operand 468 states and 486 transitions. Second operand 81 states. [2019-11-15 20:46:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:07,689 INFO L93 Difference]: Finished difference Result 474 states and 492 transitions. [2019-11-15 20:46:07,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-11-15 20:46:07,689 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 161 [2019-11-15 20:46:07,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:07,691 INFO L225 Difference]: With dead ends: 474 [2019-11-15 20:46:07,691 INFO L226 Difference]: Without dead ends: 471 [2019-11-15 20:46:07,692 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-11-15 20:46:07,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-11-15 20:46:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 470. [2019-11-15 20:46:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-11-15 20:46:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 488 transitions. [2019-11-15 20:46:07,700 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 488 transitions. Word has length 161 [2019-11-15 20:46:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:07,700 INFO L462 AbstractCegarLoop]: Abstraction has 470 states and 488 transitions. [2019-11-15 20:46:07,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-11-15 20:46:07,701 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 488 transitions. [2019-11-15 20:46:07,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-15 20:46:07,702 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:07,702 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:46:07,905 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:07,906 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:07,906 INFO L82 PathProgramCache]: Analyzing trace with hash 849787730, now seen corresponding path program 12 times [2019-11-15 20:46:07,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:07,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731010091] [2019-11-15 20:46:07,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:07,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:07,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:10,691 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:10,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731010091] [2019-11-15 20:46:10,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632543450] [2019-11-15 20:46:10,692 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:10,825 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-15 20:46:10,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:46:10,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 81 conjunts are in the unsatisfiable core [2019-11-15 20:46:10,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:10,871 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:46:10,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2019-11-15 20:46:10,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984677073] [2019-11-15 20:46:10,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-11-15 20:46:10,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:10,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-11-15 20:46:10,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-11-15 20:46:10,873 INFO L87 Difference]: Start difference. First operand 470 states and 488 transitions. Second operand 82 states. [2019-11-15 20:46:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:16,106 INFO L93 Difference]: Finished difference Result 476 states and 494 transitions. [2019-11-15 20:46:16,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-11-15 20:46:16,106 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 163 [2019-11-15 20:46:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:16,108 INFO L225 Difference]: With dead ends: 476 [2019-11-15 20:46:16,108 INFO L226 Difference]: Without dead ends: 473 [2019-11-15 20:46:16,109 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-11-15 20:46:16,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-11-15 20:46:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 472. [2019-11-15 20:46:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-11-15 20:46:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 490 transitions. [2019-11-15 20:46:16,118 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 490 transitions. Word has length 163 [2019-11-15 20:46:16,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:16,119 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 490 transitions. [2019-11-15 20:46:16,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-11-15 20:46:16,119 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 490 transitions. [2019-11-15 20:46:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-15 20:46:16,120 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:16,121 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:46:16,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:16,324 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:16,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:16,325 INFO L82 PathProgramCache]: Analyzing trace with hash 594696844, now seen corresponding path program 13 times [2019-11-15 20:46:16,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:16,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727182789] [2019-11-15 20:46:16,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:16,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:16,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:18,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727182789] [2019-11-15 20:46:18,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976714737] [2019-11-15 20:46:18,974 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 82 conjunts are in the unsatisfiable core [2019-11-15 20:46:19,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:19,146 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:46:19,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2019-11-15 20:46:19,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747071336] [2019-11-15 20:46:19,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-11-15 20:46:19,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:19,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-11-15 20:46:19,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-11-15 20:46:19,148 INFO L87 Difference]: Start difference. First operand 472 states and 490 transitions. Second operand 83 states. [2019-11-15 20:46:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:21,808 INFO L93 Difference]: Finished difference Result 478 states and 496 transitions. [2019-11-15 20:46:21,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-11-15 20:46:21,810 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 165 [2019-11-15 20:46:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:21,812 INFO L225 Difference]: With dead ends: 478 [2019-11-15 20:46:21,812 INFO L226 Difference]: Without dead ends: 475 [2019-11-15 20:46:21,813 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-11-15 20:46:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-11-15 20:46:21,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 474. [2019-11-15 20:46:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-11-15 20:46:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 492 transitions. [2019-11-15 20:46:21,823 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 492 transitions. Word has length 165 [2019-11-15 20:46:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:21,824 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 492 transitions. [2019-11-15 20:46:21,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-11-15 20:46:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 492 transitions. [2019-11-15 20:46:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-15 20:46:21,825 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:21,826 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:46:22,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:22,029 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:22,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:22,030 INFO L82 PathProgramCache]: Analyzing trace with hash 265491270, now seen corresponding path program 14 times [2019-11-15 20:46:22,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:22,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509539709] [2019-11-15 20:46:22,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:22,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:22,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:25,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509539709] [2019-11-15 20:46:25,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308003034] [2019-11-15 20:46:25,022 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:25,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:46:25,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:46:25,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 83 conjunts are in the unsatisfiable core [2019-11-15 20:46:25,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:25,190 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:46:25,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2019-11-15 20:46:25,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877556342] [2019-11-15 20:46:25,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-11-15 20:46:25,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:25,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-11-15 20:46:25,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-11-15 20:46:25,192 INFO L87 Difference]: Start difference. First operand 474 states and 492 transitions. Second operand 84 states. [2019-11-15 20:46:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:30,219 INFO L93 Difference]: Finished difference Result 480 states and 498 transitions. [2019-11-15 20:46:30,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-11-15 20:46:30,219 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 167 [2019-11-15 20:46:30,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:30,221 INFO L225 Difference]: With dead ends: 480 [2019-11-15 20:46:30,222 INFO L226 Difference]: Without dead ends: 477 [2019-11-15 20:46:30,222 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-11-15 20:46:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-11-15 20:46:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 476. [2019-11-15 20:46:30,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-11-15 20:46:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 494 transitions. [2019-11-15 20:46:30,232 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 494 transitions. Word has length 167 [2019-11-15 20:46:30,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:30,232 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 494 transitions. [2019-11-15 20:46:30,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-11-15 20:46:30,232 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 494 transitions. [2019-11-15 20:46:30,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-15 20:46:30,234 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:30,234 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:46:30,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:30,443 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:30,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:30,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1726514560, now seen corresponding path program 15 times [2019-11-15 20:46:30,444 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:30,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329891421] [2019-11-15 20:46:30,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:30,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:30,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:33,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329891421] [2019-11-15 20:46:33,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937165981] [2019-11-15 20:46:33,216 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:33,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-11-15 20:46:33,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:46:33,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 84 conjunts are in the unsatisfiable core [2019-11-15 20:46:33,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:33,421 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:46:33,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2019-11-15 20:46:33,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817233442] [2019-11-15 20:46:33,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-11-15 20:46:33,422 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:33,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-11-15 20:46:33,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-11-15 20:46:33,424 INFO L87 Difference]: Start difference. First operand 476 states and 494 transitions. Second operand 85 states. [2019-11-15 20:46:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:38,495 INFO L93 Difference]: Finished difference Result 482 states and 500 transitions. [2019-11-15 20:46:38,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-11-15 20:46:38,502 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 169 [2019-11-15 20:46:38,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:38,504 INFO L225 Difference]: With dead ends: 482 [2019-11-15 20:46:38,504 INFO L226 Difference]: Without dead ends: 479 [2019-11-15 20:46:38,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-11-15 20:46:38,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-15 20:46:38,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 478. [2019-11-15 20:46:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-11-15 20:46:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 496 transitions. [2019-11-15 20:46:38,515 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 496 transitions. Word has length 169 [2019-11-15 20:46:38,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:38,515 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 496 transitions. [2019-11-15 20:46:38,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-11-15 20:46:38,515 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 496 transitions. [2019-11-15 20:46:38,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-15 20:46:38,517 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:38,517 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:46:38,721 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:38,721 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:38,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:38,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1315590458, now seen corresponding path program 16 times [2019-11-15 20:46:38,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:38,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696412431] [2019-11-15 20:46:38,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:38,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:38,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:41,573 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:41,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696412431] [2019-11-15 20:46:41,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314070098] [2019-11-15 20:46:41,573 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:41,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:46:41,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:46:41,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 85 conjunts are in the unsatisfiable core [2019-11-15 20:46:41,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:41,774 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:46:41,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2019-11-15 20:46:41,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088876447] [2019-11-15 20:46:41,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-11-15 20:46:41,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:41,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-11-15 20:46:41,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-11-15 20:46:41,776 INFO L87 Difference]: Start difference. First operand 478 states and 496 transitions. Second operand 86 states. [2019-11-15 20:46:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:44,869 INFO L93 Difference]: Finished difference Result 484 states and 502 transitions. [2019-11-15 20:46:44,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-11-15 20:46:44,869 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 171 [2019-11-15 20:46:44,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:44,871 INFO L225 Difference]: With dead ends: 484 [2019-11-15 20:46:44,871 INFO L226 Difference]: Without dead ends: 481 [2019-11-15 20:46:44,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-11-15 20:46:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-11-15 20:46:44,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 480. [2019-11-15 20:46:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-11-15 20:46:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 498 transitions. [2019-11-15 20:46:44,881 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 498 transitions. Word has length 171 [2019-11-15 20:46:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:44,881 INFO L462 AbstractCegarLoop]: Abstraction has 480 states and 498 transitions. [2019-11-15 20:46:44,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-11-15 20:46:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 498 transitions. [2019-11-15 20:46:44,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-15 20:46:44,883 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:44,883 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:46:45,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:45,086 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:45,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:45,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1554519668, now seen corresponding path program 17 times [2019-11-15 20:46:45,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:45,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741263677] [2019-11-15 20:46:45,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:45,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:45,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:47,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741263677] [2019-11-15 20:46:47,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266229994] [2019-11-15 20:46:47,939 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:48,089 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-11-15 20:46:48,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:46:48,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 86 conjunts are in the unsatisfiable core [2019-11-15 20:46:48,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:48,132 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:46:48,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2019-11-15 20:46:48,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500511168] [2019-11-15 20:46:48,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-11-15 20:46:48,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:48,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-11-15 20:46:48,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-11-15 20:46:48,134 INFO L87 Difference]: Start difference. First operand 480 states and 498 transitions. Second operand 87 states. [2019-11-15 20:46:50,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:50,414 INFO L93 Difference]: Finished difference Result 486 states and 504 transitions. [2019-11-15 20:46:50,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-11-15 20:46:50,415 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 173 [2019-11-15 20:46:50,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:50,416 INFO L225 Difference]: With dead ends: 486 [2019-11-15 20:46:50,416 INFO L226 Difference]: Without dead ends: 483 [2019-11-15 20:46:50,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-11-15 20:46:50,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-15 20:46:50,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 482. [2019-11-15 20:46:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-11-15 20:46:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 500 transitions. [2019-11-15 20:46:50,423 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 500 transitions. Word has length 173 [2019-11-15 20:46:50,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:50,424 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 500 transitions. [2019-11-15 20:46:50,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-11-15 20:46:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 500 transitions. [2019-11-15 20:46:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-15 20:46:50,425 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:50,425 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:46:50,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:50,626 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:50,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:50,626 INFO L82 PathProgramCache]: Analyzing trace with hash -762743506, now seen corresponding path program 18 times [2019-11-15 20:46:50,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:50,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464293928] [2019-11-15 20:46:50,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:50,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:50,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:53,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464293928] [2019-11-15 20:46:53,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512403168] [2019-11-15 20:46:53,579 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:53,772 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-11-15 20:46:53,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:46:53,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 87 conjunts are in the unsatisfiable core [2019-11-15 20:46:53,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:53,819 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:46:53,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2019-11-15 20:46:53,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995742334] [2019-11-15 20:46:53,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-11-15 20:46:53,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:53,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-11-15 20:46:53,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-11-15 20:46:53,820 INFO L87 Difference]: Start difference. First operand 482 states and 500 transitions. Second operand 88 states. [2019-11-15 20:46:56,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:56,039 INFO L93 Difference]: Finished difference Result 488 states and 506 transitions. [2019-11-15 20:46:56,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-11-15 20:46:56,040 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 175 [2019-11-15 20:46:56,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:56,042 INFO L225 Difference]: With dead ends: 488 [2019-11-15 20:46:56,042 INFO L226 Difference]: Without dead ends: 485 [2019-11-15 20:46:56,042 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-11-15 20:46:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-11-15 20:46:56,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 484. [2019-11-15 20:46:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-11-15 20:46:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 502 transitions. [2019-11-15 20:46:56,051 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 502 transitions. Word has length 175 [2019-11-15 20:46:56,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:56,051 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 502 transitions. [2019-11-15 20:46:56,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-11-15 20:46:56,051 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 502 transitions. [2019-11-15 20:46:56,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-15 20:46:56,052 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:56,053 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:46:56,253 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:56,253 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:56,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:56,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1435372904, now seen corresponding path program 19 times [2019-11-15 20:46:56,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:56,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632584344] [2019-11-15 20:46:56,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:56,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:56,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:59,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632584344] [2019-11-15 20:46:59,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605943358] [2019-11-15 20:46:59,209 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:59,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 88 conjunts are in the unsatisfiable core [2019-11-15 20:46:59,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:59,410 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:46:59,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2019-11-15 20:46:59,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271912087] [2019-11-15 20:46:59,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-11-15 20:46:59,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:59,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-11-15 20:46:59,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-11-15 20:46:59,413 INFO L87 Difference]: Start difference. First operand 484 states and 502 transitions. Second operand 89 states. [2019-11-15 20:47:02,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:02,461 INFO L93 Difference]: Finished difference Result 490 states and 508 transitions. [2019-11-15 20:47:02,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-11-15 20:47:02,461 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 177 [2019-11-15 20:47:02,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:02,463 INFO L225 Difference]: With dead ends: 490 [2019-11-15 20:47:02,463 INFO L226 Difference]: Without dead ends: 487 [2019-11-15 20:47:02,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-11-15 20:47:02,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-15 20:47:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 486. [2019-11-15 20:47:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-11-15 20:47:02,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 504 transitions. [2019-11-15 20:47:02,471 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 504 transitions. Word has length 177 [2019-11-15 20:47:02,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:02,472 INFO L462 AbstractCegarLoop]: Abstraction has 486 states and 504 transitions. [2019-11-15 20:47:02,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-11-15 20:47:02,472 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 504 transitions. [2019-11-15 20:47:02,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-15 20:47:02,473 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:02,473 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:47:02,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:47:02,674 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:02,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:02,674 INFO L82 PathProgramCache]: Analyzing trace with hash 701333282, now seen corresponding path program 20 times [2019-11-15 20:47:02,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:02,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748183208] [2019-11-15 20:47:02,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:02,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:02,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:05,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748183208] [2019-11-15 20:47:05,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137249499] [2019-11-15 20:47:05,724 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:47:05,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:47:05,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:47:05,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 89 conjunts are in the unsatisfiable core [2019-11-15 20:47:05,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:47:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:05,947 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:47:05,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2019-11-15 20:47:05,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328187561] [2019-11-15 20:47:05,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-11-15 20:47:05,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:05,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-11-15 20:47:05,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-11-15 20:47:05,951 INFO L87 Difference]: Start difference. First operand 486 states and 504 transitions. Second operand 90 states. [2019-11-15 20:47:10,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:10,880 INFO L93 Difference]: Finished difference Result 492 states and 510 transitions. [2019-11-15 20:47:10,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-11-15 20:47:10,881 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 179 [2019-11-15 20:47:10,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:10,882 INFO L225 Difference]: With dead ends: 492 [2019-11-15 20:47:10,882 INFO L226 Difference]: Without dead ends: 489 [2019-11-15 20:47:10,883 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-11-15 20:47:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-11-15 20:47:10,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 488. [2019-11-15 20:47:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-11-15 20:47:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 506 transitions. [2019-11-15 20:47:10,891 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 506 transitions. Word has length 179 [2019-11-15 20:47:10,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:10,892 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 506 transitions. [2019-11-15 20:47:10,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-11-15 20:47:10,892 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 506 transitions. [2019-11-15 20:47:10,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-15 20:47:10,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:10,894 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:47:11,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:47:11,097 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:11,098 INFO L82 PathProgramCache]: Analyzing trace with hash -336106916, now seen corresponding path program 21 times [2019-11-15 20:47:11,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:11,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012150378] [2019-11-15 20:47:11,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:11,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:11,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:14,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012150378] [2019-11-15 20:47:14,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604803513] [2019-11-15 20:47:14,204 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:47:14,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-11-15 20:47:14,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:47:14,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 90 conjunts are in the unsatisfiable core [2019-11-15 20:47:14,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:47:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:14,472 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:47:14,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2019-11-15 20:47:14,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013721832] [2019-11-15 20:47:14,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-11-15 20:47:14,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:14,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-11-15 20:47:14,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-11-15 20:47:14,474 INFO L87 Difference]: Start difference. First operand 488 states and 506 transitions. Second operand 91 states. [2019-11-15 20:47:19,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:19,587 INFO L93 Difference]: Finished difference Result 494 states and 512 transitions. [2019-11-15 20:47:19,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-11-15 20:47:19,587 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 181 [2019-11-15 20:47:19,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:19,589 INFO L225 Difference]: With dead ends: 494 [2019-11-15 20:47:19,589 INFO L226 Difference]: Without dead ends: 491 [2019-11-15 20:47:19,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-11-15 20:47:19,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-11-15 20:47:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 490. [2019-11-15 20:47:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-11-15 20:47:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 508 transitions. [2019-11-15 20:47:19,596 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 508 transitions. Word has length 181 [2019-11-15 20:47:19,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:19,596 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 508 transitions. [2019-11-15 20:47:19,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-11-15 20:47:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 508 transitions. [2019-11-15 20:47:19,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-15 20:47:19,597 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:19,598 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:47:19,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:47:19,801 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:19,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:19,802 INFO L82 PathProgramCache]: Analyzing trace with hash -883724522, now seen corresponding path program 22 times [2019-11-15 20:47:19,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:19,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600255989] [2019-11-15 20:47:19,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:19,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:19,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:22,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600255989] [2019-11-15 20:47:22,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087404075] [2019-11-15 20:47:22,975 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:47:23,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:47:23,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:47:23,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 91 conjunts are in the unsatisfiable core [2019-11-15 20:47:23,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:47:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:23,196 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:47:23,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2019-11-15 20:47:23,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705920006] [2019-11-15 20:47:23,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-11-15 20:47:23,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:23,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-11-15 20:47:23,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-11-15 20:47:23,198 INFO L87 Difference]: Start difference. First operand 490 states and 508 transitions. Second operand 92 states. [2019-11-15 20:47:25,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:25,618 INFO L93 Difference]: Finished difference Result 496 states and 514 transitions. [2019-11-15 20:47:25,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-11-15 20:47:25,618 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 183 [2019-11-15 20:47:25,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:25,620 INFO L225 Difference]: With dead ends: 496 [2019-11-15 20:47:25,620 INFO L226 Difference]: Without dead ends: 493 [2019-11-15 20:47:25,621 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-11-15 20:47:25,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-11-15 20:47:25,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 492. [2019-11-15 20:47:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-11-15 20:47:25,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 510 transitions. [2019-11-15 20:47:25,627 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 510 transitions. Word has length 183 [2019-11-15 20:47:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:25,627 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 510 transitions. [2019-11-15 20:47:25,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-11-15 20:47:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 510 transitions. [2019-11-15 20:47:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-15 20:47:25,628 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:25,629 INFO L380 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:47:25,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:47:25,832 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:25,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1136733520, now seen corresponding path program 23 times [2019-11-15 20:47:25,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:25,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065968821] [2019-11-15 20:47:25,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:25,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:25,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:29,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065968821] [2019-11-15 20:47:29,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341648851] [2019-11-15 20:47:29,054 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:47:29,242 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-11-15 20:47:29,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:47:29,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 92 conjunts are in the unsatisfiable core [2019-11-15 20:47:29,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:47:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:29,294 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:47:29,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-11-15 20:47:29,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53964417] [2019-11-15 20:47:29,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-11-15 20:47:29,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:29,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-11-15 20:47:29,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-11-15 20:47:29,296 INFO L87 Difference]: Start difference. First operand 492 states and 510 transitions. Second operand 93 states. [2019-11-15 20:47:34,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:34,282 INFO L93 Difference]: Finished difference Result 498 states and 516 transitions. [2019-11-15 20:47:34,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-11-15 20:47:34,283 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 185 [2019-11-15 20:47:34,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:34,284 INFO L225 Difference]: With dead ends: 498 [2019-11-15 20:47:34,284 INFO L226 Difference]: Without dead ends: 495 [2019-11-15 20:47:34,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-11-15 20:47:34,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-11-15 20:47:34,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 494. [2019-11-15 20:47:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-11-15 20:47:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 512 transitions. [2019-11-15 20:47:34,292 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 512 transitions. Word has length 185 [2019-11-15 20:47:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:34,293 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 512 transitions. [2019-11-15 20:47:34,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-11-15 20:47:34,293 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 512 transitions. [2019-11-15 20:47:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-15 20:47:34,294 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:34,294 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:47:34,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:47:34,495 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:34,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:34,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1471694090, now seen corresponding path program 24 times [2019-11-15 20:47:34,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:34,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624867383] [2019-11-15 20:47:34,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:34,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:34,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:37,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624867383] [2019-11-15 20:47:37,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827772207] [2019-11-15 20:47:37,844 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:47:38,049 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-11-15 20:47:38,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:47:38,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 93 conjunts are in the unsatisfiable core [2019-11-15 20:47:38,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:47:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:38,103 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:47:38,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2019-11-15 20:47:38,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059870869] [2019-11-15 20:47:38,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-11-15 20:47:38,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:38,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-11-15 20:47:38,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-11-15 20:47:38,106 INFO L87 Difference]: Start difference. First operand 494 states and 512 transitions. Second operand 94 states. [2019-11-15 20:47:40,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:40,924 INFO L93 Difference]: Finished difference Result 500 states and 518 transitions. [2019-11-15 20:47:40,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-11-15 20:47:40,924 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 187 [2019-11-15 20:47:40,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:40,926 INFO L225 Difference]: With dead ends: 500 [2019-11-15 20:47:40,926 INFO L226 Difference]: Without dead ends: 497 [2019-11-15 20:47:40,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-11-15 20:47:40,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-11-15 20:47:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 496. [2019-11-15 20:47:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-11-15 20:47:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 514 transitions. [2019-11-15 20:47:40,933 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 514 transitions. Word has length 187 [2019-11-15 20:47:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:40,933 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 514 transitions. [2019-11-15 20:47:40,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-11-15 20:47:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 514 transitions. [2019-11-15 20:47:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-15 20:47:40,934 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:40,934 INFO L380 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:47:41,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:47:41,138 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:41,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:41,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1246254660, now seen corresponding path program 25 times [2019-11-15 20:47:41,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:41,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492236981] [2019-11-15 20:47:41,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:41,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:41,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:44,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492236981] [2019-11-15 20:47:44,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497267086] [2019-11-15 20:47:44,487 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:47:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:44,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 94 conjunts are in the unsatisfiable core [2019-11-15 20:47:44,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:47:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:44,722 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:47:44,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-11-15 20:47:44,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726238805] [2019-11-15 20:47:44,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-11-15 20:47:44,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:44,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-11-15 20:47:44,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-11-15 20:47:44,725 INFO L87 Difference]: Start difference. First operand 496 states and 514 transitions. Second operand 95 states. [2019-11-15 20:47:49,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:49,688 INFO L93 Difference]: Finished difference Result 502 states and 520 transitions. [2019-11-15 20:47:49,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-11-15 20:47:49,688 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 189 [2019-11-15 20:47:49,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:49,690 INFO L225 Difference]: With dead ends: 502 [2019-11-15 20:47:49,690 INFO L226 Difference]: Without dead ends: 499 [2019-11-15 20:47:49,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-11-15 20:47:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-11-15 20:47:49,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 498. [2019-11-15 20:47:49,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-11-15 20:47:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 516 transitions. [2019-11-15 20:47:49,698 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 516 transitions. Word has length 189 [2019-11-15 20:47:49,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:49,698 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 516 transitions. [2019-11-15 20:47:49,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-11-15 20:47:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 516 transitions. [2019-11-15 20:47:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-15 20:47:49,700 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:49,700 INFO L380 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:47:49,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:47:49,904 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:49,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:49,904 INFO L82 PathProgramCache]: Analyzing trace with hash -652672770, now seen corresponding path program 26 times [2019-11-15 20:47:49,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:49,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470916283] [2019-11-15 20:47:49,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:49,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:49,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:47:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:53,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470916283] [2019-11-15 20:47:53,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790480590] [2019-11-15 20:47:53,316 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:47:53,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:47:53,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:47:53,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 95 conjunts are in the unsatisfiable core [2019-11-15 20:47:53,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:47:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:47:53,553 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:47:53,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2019-11-15 20:47:53,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233732464] [2019-11-15 20:47:53,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-11-15 20:47:53,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:47:53,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-11-15 20:47:53,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-11-15 20:47:53,555 INFO L87 Difference]: Start difference. First operand 498 states and 516 transitions. Second operand 96 states. [2019-11-15 20:47:58,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:47:58,607 INFO L93 Difference]: Finished difference Result 504 states and 522 transitions. [2019-11-15 20:47:58,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-11-15 20:47:58,607 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 191 [2019-11-15 20:47:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:47:58,609 INFO L225 Difference]: With dead ends: 504 [2019-11-15 20:47:58,609 INFO L226 Difference]: Without dead ends: 501 [2019-11-15 20:47:58,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-11-15 20:47:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-11-15 20:47:58,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 500. [2019-11-15 20:47:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-15 20:47:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 518 transitions. [2019-11-15 20:47:58,616 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 518 transitions. Word has length 191 [2019-11-15 20:47:58,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:47:58,616 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 518 transitions. [2019-11-15 20:47:58,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-11-15 20:47:58,616 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 518 transitions. [2019-11-15 20:47:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 20:47:58,617 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:47:58,617 INFO L380 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:47:58,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:47:58,818 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:47:58,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:47:58,819 INFO L82 PathProgramCache]: Analyzing trace with hash -160832200, now seen corresponding path program 27 times [2019-11-15 20:47:58,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:47:58,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795261016] [2019-11-15 20:47:58,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:58,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:47:58,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:47:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:02,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795261016] [2019-11-15 20:48:02,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146294821] [2019-11-15 20:48:02,373 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:48:02,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-11-15 20:48:02,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:48:02,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 96 conjunts are in the unsatisfiable core [2019-11-15 20:48:02,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:48:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:02,690 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:48:02,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2019-11-15 20:48:02,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507450193] [2019-11-15 20:48:02,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-11-15 20:48:02,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:02,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-11-15 20:48:02,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-11-15 20:48:02,692 INFO L87 Difference]: Start difference. First operand 500 states and 518 transitions. Second operand 97 states. [2019-11-15 20:48:07,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:07,842 INFO L93 Difference]: Finished difference Result 506 states and 524 transitions. [2019-11-15 20:48:07,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-11-15 20:48:07,842 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 193 [2019-11-15 20:48:07,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:07,844 INFO L225 Difference]: With dead ends: 506 [2019-11-15 20:48:07,844 INFO L226 Difference]: Without dead ends: 503 [2019-11-15 20:48:07,845 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-11-15 20:48:07,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-11-15 20:48:07,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 502. [2019-11-15 20:48:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-11-15 20:48:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 520 transitions. [2019-11-15 20:48:07,851 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 520 transitions. Word has length 193 [2019-11-15 20:48:07,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:07,852 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 520 transitions. [2019-11-15 20:48:07,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-11-15 20:48:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 520 transitions. [2019-11-15 20:48:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-15 20:48:07,853 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:07,853 INFO L380 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:48:08,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:48:08,054 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:08,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:08,054 INFO L82 PathProgramCache]: Analyzing trace with hash 51553010, now seen corresponding path program 28 times [2019-11-15 20:48:08,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:08,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282229686] [2019-11-15 20:48:08,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:08,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:08,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:11,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282229686] [2019-11-15 20:48:11,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711868198] [2019-11-15 20:48:11,763 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:48:11,958 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:48:11,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:48:11,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 97 conjunts are in the unsatisfiable core [2019-11-15 20:48:11,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:48:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:12,042 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:48:12,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2019-11-15 20:48:12,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563221242] [2019-11-15 20:48:12,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-11-15 20:48:12,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:12,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-11-15 20:48:12,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-11-15 20:48:12,045 INFO L87 Difference]: Start difference. First operand 502 states and 520 transitions. Second operand 98 states. [2019-11-15 20:48:17,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:17,241 INFO L93 Difference]: Finished difference Result 508 states and 526 transitions. [2019-11-15 20:48:17,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-11-15 20:48:17,242 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 195 [2019-11-15 20:48:17,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:17,244 INFO L225 Difference]: With dead ends: 508 [2019-11-15 20:48:17,244 INFO L226 Difference]: Without dead ends: 505 [2019-11-15 20:48:17,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-11-15 20:48:17,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-11-15 20:48:17,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 504. [2019-11-15 20:48:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-11-15 20:48:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 522 transitions. [2019-11-15 20:48:17,254 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 522 transitions. Word has length 195 [2019-11-15 20:48:17,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:17,255 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 522 transitions. [2019-11-15 20:48:17,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-11-15 20:48:17,255 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 522 transitions. [2019-11-15 20:48:17,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-15 20:48:17,256 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:17,257 INFO L380 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:48:17,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:48:17,461 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:17,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:17,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2004690388, now seen corresponding path program 29 times [2019-11-15 20:48:17,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:17,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475245220] [2019-11-15 20:48:17,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:17,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:17,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:21,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475245220] [2019-11-15 20:48:21,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626135165] [2019-11-15 20:48:21,211 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:48:21,439 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-11-15 20:48:21,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:48:21,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 98 conjunts are in the unsatisfiable core [2019-11-15 20:48:21,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:48:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:21,489 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:48:21,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-11-15 20:48:21,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917189786] [2019-11-15 20:48:21,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-11-15 20:48:21,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:21,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-11-15 20:48:21,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-11-15 20:48:21,491 INFO L87 Difference]: Start difference. First operand 504 states and 522 transitions. Second operand 99 states. [2019-11-15 20:48:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:24,516 INFO L93 Difference]: Finished difference Result 510 states and 528 transitions. [2019-11-15 20:48:24,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-11-15 20:48:24,516 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 197 [2019-11-15 20:48:24,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:24,518 INFO L225 Difference]: With dead ends: 510 [2019-11-15 20:48:24,518 INFO L226 Difference]: Without dead ends: 507 [2019-11-15 20:48:24,519 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-11-15 20:48:24,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-15 20:48:24,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 506. [2019-11-15 20:48:24,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-11-15 20:48:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 524 transitions. [2019-11-15 20:48:24,525 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 524 transitions. Word has length 197 [2019-11-15 20:48:24,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:24,525 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 524 transitions. [2019-11-15 20:48:24,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-11-15 20:48:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 524 transitions. [2019-11-15 20:48:24,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-15 20:48:24,526 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:24,527 INFO L380 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:48:24,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:48:24,727 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:24,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:24,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1925327590, now seen corresponding path program 30 times [2019-11-15 20:48:24,728 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:24,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019013460] [2019-11-15 20:48:24,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:24,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:24,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:28,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019013460] [2019-11-15 20:48:28,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23300916] [2019-11-15 20:48:28,508 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:48:28,771 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-11-15 20:48:28,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:48:28,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 99 conjunts are in the unsatisfiable core [2019-11-15 20:48:28,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:48:28,820 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:28,820 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:48:28,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2019-11-15 20:48:28,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954616200] [2019-11-15 20:48:28,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-11-15 20:48:28,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:28,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-11-15 20:48:28,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-11-15 20:48:28,822 INFO L87 Difference]: Start difference. First operand 506 states and 524 transitions. Second operand 100 states. [2019-11-15 20:48:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:31,491 INFO L93 Difference]: Finished difference Result 512 states and 530 transitions. [2019-11-15 20:48:31,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-11-15 20:48:31,492 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 199 [2019-11-15 20:48:31,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:31,494 INFO L225 Difference]: With dead ends: 512 [2019-11-15 20:48:31,494 INFO L226 Difference]: Without dead ends: 509 [2019-11-15 20:48:31,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-11-15 20:48:31,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-11-15 20:48:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 508. [2019-11-15 20:48:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-11-15 20:48:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 526 transitions. [2019-11-15 20:48:31,503 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 526 transitions. Word has length 199 [2019-11-15 20:48:31,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:31,503 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 526 transitions. [2019-11-15 20:48:31,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-11-15 20:48:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 526 transitions. [2019-11-15 20:48:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 20:48:31,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:31,504 INFO L380 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:48:31,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:48:31,706 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:31,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:31,706 INFO L82 PathProgramCache]: Analyzing trace with hash -898616032, now seen corresponding path program 31 times [2019-11-15 20:48:31,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:31,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935279611] [2019-11-15 20:48:31,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:31,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:31,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:35,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935279611] [2019-11-15 20:48:35,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556795253] [2019-11-15 20:48:35,507 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:48:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:35,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 100 conjunts are in the unsatisfiable core [2019-11-15 20:48:35,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:48:35,800 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:35,800 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:48:35,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-11-15 20:48:35,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908274264] [2019-11-15 20:48:35,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-11-15 20:48:35,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:35,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-11-15 20:48:35,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-11-15 20:48:35,803 INFO L87 Difference]: Start difference. First operand 508 states and 526 transitions. Second operand 101 states. [2019-11-15 20:48:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:38,697 INFO L93 Difference]: Finished difference Result 514 states and 532 transitions. [2019-11-15 20:48:38,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-11-15 20:48:38,698 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 201 [2019-11-15 20:48:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:38,700 INFO L225 Difference]: With dead ends: 514 [2019-11-15 20:48:38,700 INFO L226 Difference]: Without dead ends: 511 [2019-11-15 20:48:38,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-11-15 20:48:38,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-11-15 20:48:38,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 510. [2019-11-15 20:48:38,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-11-15 20:48:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 528 transitions. [2019-11-15 20:48:38,709 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 528 transitions. Word has length 201 [2019-11-15 20:48:38,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:38,709 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 528 transitions. [2019-11-15 20:48:38,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-11-15 20:48:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 528 transitions. [2019-11-15 20:48:38,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-15 20:48:38,710 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:38,711 INFO L380 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:48:38,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:48:38,911 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:38,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:38,912 INFO L82 PathProgramCache]: Analyzing trace with hash -289105702, now seen corresponding path program 32 times [2019-11-15 20:48:38,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:38,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938422357] [2019-11-15 20:48:38,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:38,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:38,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:42,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938422357] [2019-11-15 20:48:42,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303931546] [2019-11-15 20:48:42,842 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:48:43,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:48:43,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:48:43,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 101 conjunts are in the unsatisfiable core [2019-11-15 20:48:43,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:48:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:43,134 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:48:43,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2019-11-15 20:48:43,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222470998] [2019-11-15 20:48:43,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-11-15 20:48:43,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:43,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-11-15 20:48:43,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-11-15 20:48:43,138 INFO L87 Difference]: Start difference. First operand 510 states and 528 transitions. Second operand 102 states. [2019-11-15 20:48:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:46,292 INFO L93 Difference]: Finished difference Result 515 states and 533 transitions. [2019-11-15 20:48:46,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-11-15 20:48:46,292 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 203 [2019-11-15 20:48:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:46,295 INFO L225 Difference]: With dead ends: 515 [2019-11-15 20:48:46,295 INFO L226 Difference]: Without dead ends: 512 [2019-11-15 20:48:46,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-11-15 20:48:46,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-11-15 20:48:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2019-11-15 20:48:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-15 20:48:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 530 transitions. [2019-11-15 20:48:46,305 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 530 transitions. Word has length 203 [2019-11-15 20:48:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:46,306 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 530 transitions. [2019-11-15 20:48:46,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-11-15 20:48:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 530 transitions. [2019-11-15 20:48:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-15 20:48:46,307 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:46,307 INFO L380 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:48:46,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:48:46,511 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:46,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:46,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1334769172, now seen corresponding path program 33 times [2019-11-15 20:48:46,512 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:46,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700508874] [2019-11-15 20:48:46,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:46,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:46,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:48,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700508874] [2019-11-15 20:48:48,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700586617] [2019-11-15 20:48:48,344 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:48:48,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-11-15 20:48:48,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:48:48,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 108 conjunts are in the unsatisfiable core [2019-11-15 20:48:48,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:48:48,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:48:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:48,846 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:48:48,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-11-15 20:48:48,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926368068] [2019-11-15 20:48:48,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-15 20:48:48,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:48,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-15 20:48:48,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-11-15 20:48:48,848 INFO L87 Difference]: Start difference. First operand 512 states and 530 transitions. Second operand 55 states. [2019-11-15 20:48:53,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:53,455 INFO L93 Difference]: Finished difference Result 518 states and 536 transitions. [2019-11-15 20:48:53,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-15 20:48:53,455 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 205 [2019-11-15 20:48:53,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:53,457 INFO L225 Difference]: With dead ends: 518 [2019-11-15 20:48:53,457 INFO L226 Difference]: Without dead ends: 515 [2019-11-15 20:48:53,458 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-11-15 20:48:53,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-11-15 20:48:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 514. [2019-11-15 20:48:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-11-15 20:48:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 532 transitions. [2019-11-15 20:48:53,468 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 532 transitions. Word has length 205 [2019-11-15 20:48:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:53,469 INFO L462 AbstractCegarLoop]: Abstraction has 514 states and 532 transitions. [2019-11-15 20:48:53,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-15 20:48:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 532 transitions. [2019-11-15 20:48:53,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-15 20:48:53,470 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:48:53,470 INFO L380 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:48:53,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:48:53,678 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:48:53,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:48:53,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1489572658, now seen corresponding path program 34 times [2019-11-15 20:48:53,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:48:53,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689704572] [2019-11-15 20:48:53,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:53,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:48:53,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:48:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:48:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:48:54,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689704572] [2019-11-15 20:48:54,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:48:54,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-11-15 20:48:54,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948268660] [2019-11-15 20:48:54,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-11-15 20:48:54,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:48:54,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-11-15 20:48:54,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-11-15 20:48:54,868 INFO L87 Difference]: Start difference. First operand 514 states and 532 transitions. Second operand 52 states. [2019-11-15 20:48:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:48:55,659 INFO L93 Difference]: Finished difference Result 514 states and 532 transitions. [2019-11-15 20:48:55,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-11-15 20:48:55,660 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 207 [2019-11-15 20:48:55,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:48:55,660 INFO L225 Difference]: With dead ends: 514 [2019-11-15 20:48:55,660 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:48:55,661 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-11-15 20:48:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:48:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:48:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:48:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:48:55,662 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2019-11-15 20:48:55,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:48:55,662 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:48:55,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-11-15 20:48:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:48:55,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:48:55,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:48:56,044 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2019-11-15 20:48:56,330 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-11-15 20:48:56,736 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-11-15 20:48:57,960 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 307 DAG size of output: 307 [2019-11-15 20:48:58,146 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-11-15 20:48:58,363 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2019-11-15 20:48:58,710 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 104 [2019-11-15 20:48:58,852 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-11-15 20:48:59,056 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-11-15 20:48:59,361 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 98 [2019-11-15 20:48:59,478 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-11-15 20:48:59,501 INFO L439 ceAbstractionStarter]: At program point L1126(lines 74 1127) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 11) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,502 INFO L439 ceAbstractionStarter]: At program point L994(lines 140 995) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 22) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,502 INFO L439 ceAbstractionStarter]: At program point L862(lines 206 863) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 33) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,502 INFO L439 ceAbstractionStarter]: At program point L730(lines 272 731) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 44) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,502 INFO L439 ceAbstractionStarter]: At program point L598(lines 338 599) the Hoare annotation is: (or (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52)) (and (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__x~0) (<= 55 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 55))) [2019-11-15 20:48:59,502 INFO L439 ceAbstractionStarter]: At program point L466(lines 404 467) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~main__y~0 66) (<= 66 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 66) (<= 66 ULTIMATE.start_main_~main__x~0)) (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 56 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 56) (<= 56 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 56)) (and (<= 59 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 59) (<= ULTIMATE.start_main_~main__x~0 59) (<= 59 ULTIMATE.start_main_~main__x~0)) (and (<= ULTIMATE.start_main_~main__y~0 58) (<= 58 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 58) (<= 58 ULTIMATE.start_main_~main__y~0)) (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) (and (<= 60 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 60) (<= 60 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 60)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52)) (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= ULTIMATE.start_main_~main__x~0 63) (<= ULTIMATE.start_main_~main__y~0 63) (<= 63 ULTIMATE.start_main_~main__x~0) (<= 63 ULTIMATE.start_main_~main__y~0)) (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) (and (<= 57 ULTIMATE.start_main_~main__x~0) (<= 57 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 57) (<= ULTIMATE.start_main_~main__y~0 57)) (and (<= ULTIMATE.start_main_~main__x~0 61) (<= 61 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 61) (<= 61 ULTIMATE.start_main_~main__y~0)) (and (<= 62 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 62) (<= 62 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 62)) (and (<= 64 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 64) (<= 64 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 64)) (and (<= ULTIMATE.start_main_~main__y~0 65) (<= 65 ULTIMATE.start_main_~main__x~0) (<= 65 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 65)) (and (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__x~0) (<= 55 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 55))) [2019-11-15 20:48:59,502 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 539) no Hoare annotation was computed. [2019-11-15 20:48:59,503 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 671) no Hoare annotation was computed. [2019-11-15 20:48:59,503 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 803) no Hoare annotation was computed. [2019-11-15 20:48:59,503 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 935) no Hoare annotation was computed. [2019-11-15 20:48:59,503 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 1067) no Hoare annotation was computed. [2019-11-15 20:48:59,503 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 1199) no Hoare annotation was computed. [2019-11-15 20:48:59,503 INFO L439 ceAbstractionStarter]: At program point L1162(lines 56 1163) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 8) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,503 INFO L439 ceAbstractionStarter]: At program point L1030(lines 122 1031) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 19) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,503 INFO L439 ceAbstractionStarter]: At program point L898(lines 188 899) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 30) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,503 INFO L439 ceAbstractionStarter]: At program point L766(lines 254 767) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 41) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,503 INFO L439 ceAbstractionStarter]: At program point L634(lines 320 635) the Hoare annotation is: (or (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52))) [2019-11-15 20:48:59,503 INFO L439 ceAbstractionStarter]: At program point L502(lines 386 503) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 56 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 56) (<= 56 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 56)) (and (<= 59 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 59) (<= ULTIMATE.start_main_~main__x~0 59) (<= 59 ULTIMATE.start_main_~main__x~0)) (and (<= ULTIMATE.start_main_~main__y~0 58) (<= 58 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 58) (<= 58 ULTIMATE.start_main_~main__y~0)) (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) (and (<= 60 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 60) (<= 60 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 60)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52)) (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= ULTIMATE.start_main_~main__x~0 63) (<= ULTIMATE.start_main_~main__y~0 63) (<= 63 ULTIMATE.start_main_~main__x~0) (<= 63 ULTIMATE.start_main_~main__y~0)) (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) (and (<= 57 ULTIMATE.start_main_~main__x~0) (<= 57 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 57) (<= ULTIMATE.start_main_~main__y~0 57)) (and (<= ULTIMATE.start_main_~main__x~0 61) (<= 61 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 61) (<= 61 ULTIMATE.start_main_~main__y~0)) (and (<= 62 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 62) (<= 62 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 62)) (and (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__x~0) (<= 55 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 55))) [2019-11-15 20:48:59,504 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2019-11-15 20:48:59,504 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 467) no Hoare annotation was computed. [2019-11-15 20:48:59,504 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 599) no Hoare annotation was computed. [2019-11-15 20:48:59,504 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 731) no Hoare annotation was computed. [2019-11-15 20:48:59,504 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 863) no Hoare annotation was computed. [2019-11-15 20:48:59,504 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 995) no Hoare annotation was computed. [2019-11-15 20:48:59,504 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 1127) no Hoare annotation was computed. [2019-11-15 20:48:59,504 INFO L439 ceAbstractionStarter]: At program point L1198(lines 38 1199) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 5) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,504 INFO L439 ceAbstractionStarter]: At program point L1066(lines 104 1067) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 16) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,504 INFO L439 ceAbstractionStarter]: At program point L934(lines 170 935) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 27) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,504 INFO L439 ceAbstractionStarter]: At program point L802(lines 236 803) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 38) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,504 INFO L439 ceAbstractionStarter]: At program point L670(lines 302 671) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 49) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,505 INFO L439 ceAbstractionStarter]: At program point L538(lines 368 539) the Hoare annotation is: (or (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 56 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 56) (<= 56 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 56)) (and (<= 59 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 59) (<= ULTIMATE.start_main_~main__x~0 59) (<= 59 ULTIMATE.start_main_~main__x~0)) (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) (and (<= 57 ULTIMATE.start_main_~main__x~0) (<= 57 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 57) (<= ULTIMATE.start_main_~main__y~0 57)) (and (<= ULTIMATE.start_main_~main__y~0 58) (<= 58 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 58) (<= 58 ULTIMATE.start_main_~main__y~0)) (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) (and (<= 60 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 60) (<= 60 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 60)) (and (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__x~0) (<= 55 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 55)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52))) [2019-11-15 20:48:59,505 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-15 20:48:59,505 INFO L443 ceAbstractionStarter]: For program point L374(lines 374 527) no Hoare annotation was computed. [2019-11-15 20:48:59,505 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 659) no Hoare annotation was computed. [2019-11-15 20:48:59,505 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 791) no Hoare annotation was computed. [2019-11-15 20:48:59,505 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 923) no Hoare annotation was computed. [2019-11-15 20:48:59,505 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 1055) no Hoare annotation was computed. [2019-11-15 20:48:59,505 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 1187) no Hoare annotation was computed. [2019-11-15 20:48:59,505 INFO L439 ceAbstractionStarter]: At program point L1234(lines 20 1235) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 2) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,505 INFO L439 ceAbstractionStarter]: At program point L1102(lines 86 1103) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 13) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,505 INFO L443 ceAbstractionStarter]: For program point L12(lines 12 1252) no Hoare annotation was computed. [2019-11-15 20:48:59,505 INFO L439 ceAbstractionStarter]: At program point L970(lines 152 971) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 24) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,505 INFO L439 ceAbstractionStarter]: At program point L838(lines 218 839) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 35) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,505 INFO L439 ceAbstractionStarter]: At program point L706(lines 284 707) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 46) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,506 INFO L439 ceAbstractionStarter]: At program point L574(lines 350 575) the Hoare annotation is: (or (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 56 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 56) (<= 56 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 56)) (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) (and (<= 57 ULTIMATE.start_main_~main__x~0) (<= 57 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 57) (<= ULTIMATE.start_main_~main__y~0 57)) (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) (and (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__x~0) (<= 55 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 55)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52))) [2019-11-15 20:48:59,506 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 455) no Hoare annotation was computed. [2019-11-15 20:48:59,506 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 587) no Hoare annotation was computed. [2019-11-15 20:48:59,506 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 719) no Hoare annotation was computed. [2019-11-15 20:48:59,506 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 851) no Hoare annotation was computed. [2019-11-15 20:48:59,506 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 983) no Hoare annotation was computed. [2019-11-15 20:48:59,506 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 1115) no Hoare annotation was computed. [2019-11-15 20:48:59,506 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 1247) no Hoare annotation was computed. [2019-11-15 20:48:59,506 INFO L439 ceAbstractionStarter]: At program point L1138(lines 68 1139) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 10) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,506 INFO L439 ceAbstractionStarter]: At program point L1006(lines 134 1007) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 21) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,506 INFO L439 ceAbstractionStarter]: At program point L874(lines 200 875) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 32) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,506 INFO L439 ceAbstractionStarter]: At program point L742(lines 266 743) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 43) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,507 INFO L439 ceAbstractionStarter]: At program point L610(lines 332 611) the Hoare annotation is: (or (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52))) [2019-11-15 20:48:59,507 INFO L439 ceAbstractionStarter]: At program point L478(lines 398 479) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 56 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 56) (<= 56 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 56)) (and (<= 59 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 59) (<= ULTIMATE.start_main_~main__x~0 59) (<= 59 ULTIMATE.start_main_~main__x~0)) (and (<= ULTIMATE.start_main_~main__y~0 58) (<= 58 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 58) (<= 58 ULTIMATE.start_main_~main__y~0)) (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) (and (<= 60 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 60) (<= 60 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 60)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52)) (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= ULTIMATE.start_main_~main__x~0 63) (<= ULTIMATE.start_main_~main__y~0 63) (<= 63 ULTIMATE.start_main_~main__x~0) (<= 63 ULTIMATE.start_main_~main__y~0)) (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) (and (<= 57 ULTIMATE.start_main_~main__x~0) (<= 57 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 57) (<= ULTIMATE.start_main_~main__y~0 57)) (and (<= ULTIMATE.start_main_~main__x~0 61) (<= 61 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 61) (<= 61 ULTIMATE.start_main_~main__y~0)) (and (<= 62 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 62) (<= 62 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 62)) (and (<= 64 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 64) (<= 64 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 64)) (and (<= ULTIMATE.start_main_~main__y~0 65) (<= 65 ULTIMATE.start_main_~main__x~0) (<= 65 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 65)) (and (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__x~0) (<= 55 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 55))) [2019-11-15 20:48:59,507 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 515) no Hoare annotation was computed. [2019-11-15 20:48:59,507 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 647) no Hoare annotation was computed. [2019-11-15 20:48:59,507 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 779) no Hoare annotation was computed. [2019-11-15 20:48:59,507 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 911) no Hoare annotation was computed. [2019-11-15 20:48:59,507 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 1043) no Hoare annotation was computed. [2019-11-15 20:48:59,507 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 1175) no Hoare annotation was computed. [2019-11-15 20:48:59,507 INFO L439 ceAbstractionStarter]: At program point L1174(lines 50 1175) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 7) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,507 INFO L439 ceAbstractionStarter]: At program point L1042(lines 116 1043) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 18) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,507 INFO L439 ceAbstractionStarter]: At program point L910(lines 182 911) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 29) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,508 INFO L439 ceAbstractionStarter]: At program point L778(lines 248 779) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 40) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,508 INFO L439 ceAbstractionStarter]: At program point L646(lines 314 647) the Hoare annotation is: (or (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50))) [2019-11-15 20:48:59,508 INFO L439 ceAbstractionStarter]: At program point L514(lines 380 515) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 56 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 56) (<= 56 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 56)) (and (<= 59 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 59) (<= ULTIMATE.start_main_~main__x~0 59) (<= 59 ULTIMATE.start_main_~main__x~0)) (and (<= ULTIMATE.start_main_~main__y~0 58) (<= 58 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 58) (<= 58 ULTIMATE.start_main_~main__y~0)) (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) (and (<= 60 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 60) (<= 60 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 60)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52)) (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) (and (<= 57 ULTIMATE.start_main_~main__x~0) (<= 57 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 57) (<= ULTIMATE.start_main_~main__y~0 57)) (and (<= ULTIMATE.start_main_~main__x~0 61) (<= 61 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 61) (<= 61 ULTIMATE.start_main_~main__y~0)) (and (<= 62 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 62) (<= 62 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 62)) (and (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__x~0) (<= 55 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 55))) [2019-11-15 20:48:59,508 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 575) no Hoare annotation was computed. [2019-11-15 20:48:59,508 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:48:59,508 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 707) no Hoare annotation was computed. [2019-11-15 20:48:59,508 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 839) no Hoare annotation was computed. [2019-11-15 20:48:59,508 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 971) no Hoare annotation was computed. [2019-11-15 20:48:59,508 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 1103) no Hoare annotation was computed. [2019-11-15 20:48:59,508 INFO L443 ceAbstractionStarter]: For program point L20(lines 20 1235) no Hoare annotation was computed. [2019-11-15 20:48:59,508 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 439) no Hoare annotation was computed. [2019-11-15 20:48:59,508 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 428) no Hoare annotation was computed. [2019-11-15 20:48:59,509 INFO L439 ceAbstractionStarter]: At program point L1210(lines 32 1211) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 4) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,509 INFO L439 ceAbstractionStarter]: At program point L1078(lines 98 1079) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 15) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,509 INFO L439 ceAbstractionStarter]: At program point L946(lines 164 947) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 26) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,509 INFO L439 ceAbstractionStarter]: At program point L814(lines 230 815) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 37) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,509 INFO L439 ceAbstractionStarter]: At program point L682(lines 296 683) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 48) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,509 INFO L439 ceAbstractionStarter]: At program point L550(lines 362 551) the Hoare annotation is: (or (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 56 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 56) (<= 56 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 56)) (and (<= 59 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 59) (<= ULTIMATE.start_main_~main__x~0 59) (<= 59 ULTIMATE.start_main_~main__x~0)) (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) (and (<= 57 ULTIMATE.start_main_~main__x~0) (<= 57 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 57) (<= ULTIMATE.start_main_~main__y~0 57)) (and (<= ULTIMATE.start_main_~main__y~0 58) (<= 58 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 58) (<= 58 ULTIMATE.start_main_~main__y~0)) (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) (and (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__x~0) (<= 55 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 55)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52))) [2019-11-15 20:48:59,509 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 503) no Hoare annotation was computed. [2019-11-15 20:48:59,509 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 635) no Hoare annotation was computed. [2019-11-15 20:48:59,509 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 767) no Hoare annotation was computed. [2019-11-15 20:48:59,509 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 899) no Hoare annotation was computed. [2019-11-15 20:48:59,509 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 1031) no Hoare annotation was computed. [2019-11-15 20:48:59,509 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 1163) no Hoare annotation was computed. [2019-11-15 20:48:59,510 INFO L439 ceAbstractionStarter]: At program point L1246(lines 14 1247) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 1) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,510 INFO L439 ceAbstractionStarter]: At program point L1114(lines 80 1115) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 12) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,510 INFO L439 ceAbstractionStarter]: At program point L982(lines 146 983) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 23) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,510 INFO L439 ceAbstractionStarter]: At program point L850(lines 212 851) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 34) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,510 INFO L439 ceAbstractionStarter]: At program point L718(lines 278 719) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 45) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,510 INFO L439 ceAbstractionStarter]: At program point L586(lines 344 587) the Hoare annotation is: (or (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 56 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 56) (<= 56 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 56)) (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) (and (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__x~0) (<= 55 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 55)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52))) [2019-11-15 20:48:59,511 INFO L439 ceAbstractionStarter]: At program point L454(lines 410 455) the Hoare annotation is: (or (and (<= 92 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 92) (<= 92 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 92)) (and (<= 56 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 56) (<= 56 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 56)) (and (<= ULTIMATE.start_main_~main__y~0 58) (<= 58 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 58) (<= 58 ULTIMATE.start_main_~main__y~0)) (and (<= 74 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 74) (<= 74 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 74)) (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= 88 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 88) (<= ULTIMATE.start_main_~main__y~0 88) (<= 88 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__y~0 75) (<= 75 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 75) (<= 75 ULTIMATE.start_main_~main__x~0)) (and (<= ULTIMATE.start_main_~main__y~0 69) (<= 69 ULTIMATE.start_main_~main__x~0) (<= 69 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 69)) (and (<= ULTIMATE.start_main_~main__x~0 95) (<= 95 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 95) (<= 95 ULTIMATE.start_main_~main__y~0)) (and (<= 90 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 90) (<= 90 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 90)) (and (<= ULTIMATE.start_main_~main__y~0 97) (<= 97 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 97) (<= 97 ULTIMATE.start_main_~main__y~0)) (and (<= 68 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 68) (<= 68 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 68)) (and (<= ULTIMATE.start_main_~main__y~0 85) (<= ULTIMATE.start_main_~main__x~0 85) (<= 85 ULTIMATE.start_main_~main__y~0) (<= 85 ULTIMATE.start_main_~main__x~0)) (and (<= 91 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 91) (<= ULTIMATE.start_main_~main__y~0 91) (<= 91 ULTIMATE.start_main_~main__y~0)) (and (<= 71 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 71) (<= ULTIMATE.start_main_~main__x~0 71) (<= 71 ULTIMATE.start_main_~main__y~0)) (and (<= 83 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 83) (<= 83 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 83)) (and (<= ULTIMATE.start_main_~main__y~0 93) (<= 93 ULTIMATE.start_main_~main__x~0) (<= 93 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 93)) (and (<= 89 ULTIMATE.start_main_~main__x~0) (<= 89 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 89) (<= ULTIMATE.start_main_~main__x~0 89)) (and (<= ULTIMATE.start_main_~main__y~0 84) (<= 84 ULTIMATE.start_main_~main__y~0) (<= 84 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 84)) (and (<= 80 ULTIMATE.start_main_~main__y~0) (<= 80 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 80) (<= ULTIMATE.start_main_~main__y~0 80)) (and (<= 100 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 100) (<= 100 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__x~0 70) (<= ULTIMATE.start_main_~main__y~0 70) (<= 70 ULTIMATE.start_main_~main__y~0) (<= 70 ULTIMATE.start_main_~main__x~0)) (and (<= 79 ULTIMATE.start_main_~main__x~0) (<= 79 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 79) (<= ULTIMATE.start_main_~main__y~0 79)) (and (<= ULTIMATE.start_main_~main__y~0 65) (<= 65 ULTIMATE.start_main_~main__x~0) (<= 65 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 65)) (and (<= 82 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 82) (<= 82 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 82)) (and (<= 94 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 94) (<= 94 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 94)) (and (<= ULTIMATE.start_main_~main__x~0 67) (<= 67 ULTIMATE.start_main_~main__y~0) (<= 67 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 67)) (and (<= 72 ULTIMATE.start_main_~main__y~0) (<= 72 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 72) (<= ULTIMATE.start_main_~main__y~0 72)) (and (<= 78 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 78) (<= 78 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 78)) (and (<= ULTIMATE.start_main_~main__y~0 86) (<= 86 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 86) (<= 86 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__x~0 96) (<= 96 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 96) (<= 96 ULTIMATE.start_main_~main__x~0)) (and (<= 60 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 60) (<= 60 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 60)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52)) (and (<= 99 ULTIMATE.start_main_~main__x~0) (<= 99 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 99) (<= ULTIMATE.start_main_~main__y~0 99)) (and (<= ULTIMATE.start_main_~main__x~0 63) (<= ULTIMATE.start_main_~main__y~0 63) (<= 63 ULTIMATE.start_main_~main__x~0) (<= 63 ULTIMATE.start_main_~main__y~0)) (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) (and (<= 62 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 62) (<= 62 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 62)) (and (<= 64 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 64) (<= 64 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 64)) (and (<= 81 ULTIMATE.start_main_~main__x~0) (<= 81 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 81) (<= ULTIMATE.start_main_~main__x~0 81)) (and (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__x~0) (<= 55 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 55)) (and (<= ULTIMATE.start_main_~main__y~0 66) (<= 66 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 66) (<= 66 ULTIMATE.start_main_~main__x~0)) (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 59 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 59) (<= ULTIMATE.start_main_~main__x~0 59) (<= 59 ULTIMATE.start_main_~main__x~0)) (and (<= ULTIMATE.start_main_~main__y~0 98) (<= 98 ULTIMATE.start_main_~main__x~0) (<= 98 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 98)) (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) (and (<= ULTIMATE.start_main_~main__y~0 73) (<= 73 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 73) (<= 73 ULTIMATE.start_main_~main__y~0)) (and (<= 77 ULTIMATE.start_main_~main__y~0) (<= 77 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 77) (<= ULTIMATE.start_main_~main__y~0 77)) (and (<= 57 ULTIMATE.start_main_~main__x~0) (<= 57 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 57) (<= ULTIMATE.start_main_~main__y~0 57)) (and (<= ULTIMATE.start_main_~main__x~0 61) (<= 61 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 61) (<= 61 ULTIMATE.start_main_~main__y~0)) (and (<= 76 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 76) (<= 76 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 76)) (and (<= 87 ULTIMATE.start_main_~main__y~0) (<= 87 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 87) (<= ULTIMATE.start_main_~main__y~0 87))) [2019-11-15 20:48:59,511 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:48:59,511 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 563) no Hoare annotation was computed. [2019-11-15 20:48:59,511 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 695) no Hoare annotation was computed. [2019-11-15 20:48:59,511 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 827) no Hoare annotation was computed. [2019-11-15 20:48:59,512 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 959) no Hoare annotation was computed. [2019-11-15 20:48:59,512 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 1091) no Hoare annotation was computed. [2019-11-15 20:48:59,512 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 1223) no Hoare annotation was computed. [2019-11-15 20:48:59,512 INFO L439 ceAbstractionStarter]: At program point L1150(lines 62 1151) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 9) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,512 INFO L439 ceAbstractionStarter]: At program point L1018(lines 128 1019) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 20) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,512 INFO L439 ceAbstractionStarter]: At program point L886(lines 194 887) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 31) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,512 INFO L439 ceAbstractionStarter]: At program point L754(lines 260 755) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 42) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,512 INFO L439 ceAbstractionStarter]: At program point L622(lines 326 623) the Hoare annotation is: (or (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52))) [2019-11-15 20:48:59,513 INFO L439 ceAbstractionStarter]: At program point L490(lines 392 491) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 59 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 59) (<= ULTIMATE.start_main_~main__x~0 59) (<= 59 ULTIMATE.start_main_~main__x~0)) (and (<= 56 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 56) (<= 56 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 56)) (and (<= ULTIMATE.start_main_~main__y~0 58) (<= 58 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 58) (<= 58 ULTIMATE.start_main_~main__y~0)) (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) (and (<= 60 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 60) (<= 60 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 60)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52)) (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= ULTIMATE.start_main_~main__x~0 63) (<= ULTIMATE.start_main_~main__y~0 63) (<= 63 ULTIMATE.start_main_~main__x~0) (<= 63 ULTIMATE.start_main_~main__y~0)) (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) (and (<= 57 ULTIMATE.start_main_~main__x~0) (<= 57 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 57) (<= ULTIMATE.start_main_~main__y~0 57)) (and (<= ULTIMATE.start_main_~main__x~0 61) (<= 61 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 61) (<= 61 ULTIMATE.start_main_~main__y~0)) (and (<= 64 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 64) (<= 64 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 64)) (and (<= 62 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 62) (<= 62 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 62)) (and (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__x~0) (<= 55 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 55))) [2019-11-15 20:48:59,513 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:48:59,513 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 491) no Hoare annotation was computed. [2019-11-15 20:48:59,513 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 623) no Hoare annotation was computed. [2019-11-15 20:48:59,513 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 755) no Hoare annotation was computed. [2019-11-15 20:48:59,513 INFO L446 ceAbstractionStarter]: At program point L1251(lines 8 1253) the Hoare annotation is: true [2019-11-15 20:48:59,513 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 887) no Hoare annotation was computed. [2019-11-15 20:48:59,513 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 1019) no Hoare annotation was computed. [2019-11-15 20:48:59,513 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 1151) no Hoare annotation was computed. [2019-11-15 20:48:59,514 INFO L439 ceAbstractionStarter]: At program point L1186(lines 44 1187) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 6) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,514 INFO L439 ceAbstractionStarter]: At program point L1054(lines 110 1055) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50) (<= ULTIMATE.start_main_~main__x~0 17)) [2019-11-15 20:48:59,514 INFO L439 ceAbstractionStarter]: At program point L922(lines 176 923) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 28) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,514 INFO L439 ceAbstractionStarter]: At program point L790(lines 242 791) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 39) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,514 INFO L439 ceAbstractionStarter]: At program point L658(lines 308 659) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,514 INFO L439 ceAbstractionStarter]: At program point L526(lines 374 527) the Hoare annotation is: (or (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 59 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 59) (<= ULTIMATE.start_main_~main__x~0 59) (<= 59 ULTIMATE.start_main_~main__x~0)) (and (<= 56 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 56) (<= 56 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 56)) (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) (and (<= 57 ULTIMATE.start_main_~main__x~0) (<= 57 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 57) (<= ULTIMATE.start_main_~main__y~0 57)) (and (<= ULTIMATE.start_main_~main__y~0 58) (<= 58 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 58) (<= 58 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__x~0 61) (<= 61 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 61) (<= 61 ULTIMATE.start_main_~main__y~0)) (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) (and (<= 60 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 60) (<= 60 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 60)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52)) (and (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__x~0) (<= 55 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 55))) [2019-11-15 20:48:59,514 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 551) no Hoare annotation was computed. [2019-11-15 20:48:59,514 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 683) no Hoare annotation was computed. [2019-11-15 20:48:59,515 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 815) no Hoare annotation was computed. [2019-11-15 20:48:59,515 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 947) no Hoare annotation was computed. [2019-11-15 20:48:59,515 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 1079) no Hoare annotation was computed. [2019-11-15 20:48:59,515 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 1211) no Hoare annotation was computed. [2019-11-15 20:48:59,515 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:48:59,515 INFO L439 ceAbstractionStarter]: At program point L1222(lines 26 1223) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 3) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,515 INFO L439 ceAbstractionStarter]: At program point L1090(lines 92 1091) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 14) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,515 INFO L439 ceAbstractionStarter]: At program point L958(lines 158 959) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 25) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,515 INFO L439 ceAbstractionStarter]: At program point L826(lines 224 827) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 36) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,515 INFO L439 ceAbstractionStarter]: At program point L694(lines 290 695) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 47) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-11-15 20:48:59,516 INFO L439 ceAbstractionStarter]: At program point L562(lines 356 563) the Hoare annotation is: (or (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 56 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 56) (<= 56 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 56)) (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) (and (<= 57 ULTIMATE.start_main_~main__x~0) (<= 57 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 57) (<= ULTIMATE.start_main_~main__y~0 57)) (and (<= ULTIMATE.start_main_~main__y~0 58) (<= 58 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 58) (<= 58 ULTIMATE.start_main_~main__y~0)) (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52)) (and (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__x~0) (<= 55 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 55))) [2019-11-15 20:48:59,516 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 479) no Hoare annotation was computed. [2019-11-15 20:48:59,516 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 611) no Hoare annotation was computed. [2019-11-15 20:48:59,516 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 743) no Hoare annotation was computed. [2019-11-15 20:48:59,516 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 875) no Hoare annotation was computed. [2019-11-15 20:48:59,516 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 1007) no Hoare annotation was computed. [2019-11-15 20:48:59,516 INFO L443 ceAbstractionStarter]: For program point L68(lines 68 1139) no Hoare annotation was computed. [2019-11-15 20:48:59,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:48:59 BoogieIcfgContainer [2019-11-15 20:48:59,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:48:59,576 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:48:59,577 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:48:59,577 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:48:59,577 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:44:21" (3/4) ... [2019-11-15 20:48:59,581 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:48:59,600 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 20:48:59,601 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:48:59,705 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fd77c97b-6e2f-425a-b9a2-99e2f77907b4/bin/uautomizer/witness.graphml [2019-11-15 20:48:59,705 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:48:59,706 INFO L168 Benchmark]: Toolchain (without parser) took 280271.27 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 406.3 MB). Free memory was 944.8 MB in the beginning and 925.4 MB in the end (delta: 19.5 MB). Peak memory consumption was 425.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:48:59,707 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:48:59,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 574.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -214.3 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:48:59,707 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:48:59,708 INFO L168 Benchmark]: Boogie Preprocessor took 65.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:48:59,708 INFO L168 Benchmark]: RCFGBuilder took 895.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 72.2 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:48:59,708 INFO L168 Benchmark]: TraceAbstraction took 278506.23 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.2 MB). Free memory was 1.1 GB in the beginning and 950.8 MB in the end (delta: 129.7 MB). Peak memory consumption was 552.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:48:59,709 INFO L168 Benchmark]: Witness Printer took 128.67 ms. Allocated memory is still 1.4 GB. Free memory was 950.8 MB in the beginning and 925.4 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:48:59,710 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 574.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -214.3 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 895.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 72.2 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 278506.23 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.2 MB). Free memory was 1.1 GB in the beginning and 950.8 MB in the end (delta: 129.7 MB). Peak memory consumption was 552.2 MB. Max. memory is 11.5 GB. * Witness Printer took 128.67 ms. Allocated memory is still 1.4 GB. Free memory was 950.8 MB in the beginning and 925.4 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 439]: 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: 182]: Loop Invariant Derived loop invariant: (main__x <= 29 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: (((((((((((((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51) || ((main__x <= 50 && 50 <= main__y) && main__y <= 50)) || (((59 <= main__y && main__y <= 59) && main__x <= 59) && 59 <= main__x)) || (((56 <= main__y && main__x <= 56) && 56 <= main__x) && main__y <= 56)) || (((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x)) || (((57 <= main__x && 57 <= main__y) && main__x <= 57) && main__y <= 57)) || (((main__y <= 58 && 58 <= main__x) && main__x <= 58) && 58 <= main__y)) || (((main__x <= 61 && 61 <= main__x) && main__y <= 61) && 61 <= main__y)) || (((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54)) || (((60 <= main__y && main__x <= 60) && 60 <= main__x) && main__y <= 60)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52)) || (((main__x <= 55 && 55 <= main__x) && 55 <= main__y) && main__y <= 55) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 22) && main__y <= 50 - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51) || ((main__x <= 50 && 50 <= main__y) && main__y <= 50)) || (((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x)) || (((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (main__x <= 47 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (main__x <= 15 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: (main__x <= 40 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (main__x <= 8 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 25) && main__y <= 50 - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((((((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51) || ((main__x <= 50 && 50 <= main__y) && main__y <= 50)) || (((56 <= main__y && main__x <= 56) && 56 <= main__x) && main__y <= 56)) || (((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x)) || (((57 <= main__x && 57 <= main__y) && main__x <= 57) && main__y <= 57)) || (((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54)) || (((main__x <= 55 && 55 <= main__x) && 55 <= main__y) && main__y <= 55)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52) - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: (main__x <= 50 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (main__x <= 18 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 43) && main__y <= 50 - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 11) && main__y <= 50 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: (main__x <= 36 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (main__x <= 4 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (main__x <= 21 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: (((((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51) || ((main__x <= 50 && 50 <= main__y) && main__y <= 50)) || (((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: (main__x <= 46 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 14) && main__y <= 50 - InvariantResult [Line: 242]: Loop Invariant Derived loop invariant: (main__x <= 39 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (main__x <= 7 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (main__x <= 32 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 392]: Loop Invariant Derived loop invariant: (((((((((((((((main__x <= 50 && 50 <= main__y) && main__y <= 50) || (((59 <= main__y && main__y <= 59) && main__x <= 59) && 59 <= main__x)) || (((56 <= main__y && main__x <= 56) && 56 <= main__x) && main__y <= 56)) || (((main__y <= 58 && 58 <= main__x) && main__x <= 58) && 58 <= main__y)) || (((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54)) || (((60 <= main__y && main__x <= 60) && 60 <= main__x) && main__y <= 60)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52)) || (((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51)) || (((main__x <= 63 && main__y <= 63) && 63 <= main__x) && 63 <= main__y)) || (((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x)) || (((57 <= main__x && 57 <= main__y) && main__x <= 57) && main__y <= 57)) || (((main__x <= 61 && 61 <= main__x) && main__y <= 61) && 61 <= main__y)) || (((64 <= main__x && main__x <= 64) && 64 <= main__y) && main__y <= 64)) || (((62 <= main__x && main__x <= 62) && 62 <= main__y) && main__y <= 62)) || (((main__x <= 55 && 55 <= main__x) && 55 <= main__y) && main__y <= 55) - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 49) && main__y <= 50 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (50 <= main__y && main__y <= 50) && main__x <= 17 - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 42) && main__y <= 50 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (main__x <= 10 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (main__x <= 35 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((92 <= main__y && main__y <= 92) && 92 <= main__x) && main__x <= 92) || (((56 <= main__y && main__x <= 56) && 56 <= main__x) && main__y <= 56)) || (((main__y <= 58 && 58 <= main__x) && main__x <= 58) && 58 <= main__y)) || (((74 <= main__y && main__y <= 74) && 74 <= main__x) && main__x <= 74)) || (((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51)) || (((88 <= main__x && main__x <= 88) && main__y <= 88) && 88 <= main__y)) || (((main__y <= 75 && 75 <= main__y) && main__x <= 75) && 75 <= main__x)) || (((main__y <= 69 && 69 <= main__x) && 69 <= main__y) && main__x <= 69)) || (((main__x <= 95 && 95 <= main__x) && main__y <= 95) && 95 <= main__y)) || (((90 <= main__y && main__x <= 90) && 90 <= main__x) && main__y <= 90)) || (((main__y <= 97 && 97 <= main__x) && main__x <= 97) && 97 <= main__y)) || (((68 <= main__y && main__x <= 68) && 68 <= main__x) && main__y <= 68)) || (((main__y <= 85 && main__x <= 85) && 85 <= main__y) && 85 <= main__x)) || (((91 <= main__x && main__x <= 91) && main__y <= 91) && 91 <= main__y)) || (((71 <= main__x && main__y <= 71) && main__x <= 71) && 71 <= main__y)) || (((83 <= main__x && main__y <= 83) && 83 <= main__y) && main__x <= 83)) || (((main__y <= 93 && 93 <= main__x) && 93 <= main__y) && main__x <= 93)) || (((89 <= main__x && 89 <= main__y) && main__y <= 89) && main__x <= 89)) || (((main__y <= 84 && 84 <= main__y) && 84 <= main__x) && main__x <= 84)) || (((80 <= main__y && 80 <= main__x) && main__x <= 80) && main__y <= 80)) || ((100 <= main__x && main__y <= 100) && 100 <= main__y)) || (((main__x <= 70 && main__y <= 70) && 70 <= main__y) && 70 <= main__x)) || (((79 <= main__x && 79 <= main__y) && main__x <= 79) && main__y <= 79)) || (((main__y <= 65 && 65 <= main__x) && 65 <= main__y) && main__x <= 65)) || (((82 <= main__y && main__y <= 82) && 82 <= main__x) && main__x <= 82)) || (((94 <= main__x && main__x <= 94) && 94 <= main__y) && main__y <= 94)) || (((main__x <= 67 && 67 <= main__y) && 67 <= main__x) && main__y <= 67)) || (((72 <= main__y && 72 <= main__x) && main__x <= 72) && main__y <= 72)) || (((78 <= main__x && main__x <= 78) && 78 <= main__y) && main__y <= 78)) || (((main__y <= 86 && 86 <= main__x) && main__x <= 86) && 86 <= main__y)) || (((main__x <= 96 && 96 <= main__y) && main__y <= 96) && 96 <= main__x)) || (((60 <= main__y && main__x <= 60) && 60 <= main__x) && main__y <= 60)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52)) || (((99 <= main__x && 99 <= main__y) && main__x <= 99) && main__y <= 99)) || (((main__x <= 63 && main__y <= 63) && 63 <= main__x) && 63 <= main__y)) || (((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x)) || (((62 <= main__x && main__x <= 62) && 62 <= main__y) && main__y <= 62)) || (((64 <= main__x && main__x <= 64) && 64 <= main__y) && main__y <= 64)) || (((81 <= main__x && 81 <= main__y) && main__y <= 81) && main__x <= 81)) || (((main__x <= 55 && 55 <= main__x) && 55 <= main__y) && main__y <= 55)) || (((main__y <= 66 && 66 <= main__y) && main__x <= 66) && 66 <= main__x)) || ((main__x <= 50 && 50 <= main__y) && main__y <= 50)) || (((59 <= main__y && main__y <= 59) && main__x <= 59) && 59 <= main__x)) || (((main__y <= 98 && 98 <= main__x) && 98 <= main__y) && main__x <= 98)) || (((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54)) || (((main__y <= 73 && 73 <= main__x) && main__x <= 73) && 73 <= main__y)) || (((77 <= main__y && 77 <= main__x) && main__x <= 77) && main__y <= 77)) || (((57 <= main__x && 57 <= main__y) && main__x <= 57) && main__y <= 57)) || (((main__x <= 61 && 61 <= main__x) && main__y <= 61) && 61 <= main__y)) || (((76 <= main__x && main__x <= 76) && 76 <= main__y) && main__y <= 76)) || (((87 <= main__y && 87 <= main__x) && main__x <= 87) && main__y <= 87) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 3) && main__y <= 50 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (main__x <= 28 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((((((((((((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51) || ((main__x <= 50 && 50 <= main__y) && main__y <= 50)) || (((56 <= main__y && main__x <= 56) && 56 <= main__x) && main__y <= 56)) || (((59 <= main__y && main__y <= 59) && main__x <= 59) && 59 <= main__x)) || (((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x)) || (((57 <= main__x && 57 <= main__y) && main__x <= 57) && main__y <= 57)) || (((main__y <= 58 && 58 <= main__x) && main__x <= 58) && 58 <= main__y)) || (((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54)) || (((60 <= main__y && main__x <= 60) && 60 <= main__x) && main__y <= 60)) || (((main__x <= 55 && 55 <= main__x) && 55 <= main__y) && main__y <= 55)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52) - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (main__x <= 45 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 13) && main__y <= 50 - InvariantResult [Line: 236]: Loop Invariant Derived loop invariant: (main__x <= 38 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 6) && main__y <= 50 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (main__x <= 31 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((((((((((((((main__x <= 50 && 50 <= main__y) && main__y <= 50) || (((56 <= main__y && main__x <= 56) && 56 <= main__x) && main__y <= 56)) || (((59 <= main__y && main__y <= 59) && main__x <= 59) && 59 <= main__x)) || (((main__y <= 58 && 58 <= main__x) && main__x <= 58) && 58 <= main__y)) || (((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54)) || (((60 <= main__y && main__x <= 60) && 60 <= main__x) && main__y <= 60)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52)) || (((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51)) || (((main__x <= 63 && main__y <= 63) && 63 <= main__x) && 63 <= main__y)) || (((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x)) || (((57 <= main__x && 57 <= main__y) && main__x <= 57) && main__y <= 57)) || (((main__x <= 61 && 61 <= main__x) && main__y <= 61) && 61 <= main__y)) || (((62 <= main__x && main__x <= 62) && 62 <= main__y) && main__y <= 62)) || (((main__x <= 55 && 55 <= main__x) && 55 <= main__y) && main__y <= 55) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 24) && main__y <= 50 - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51) || ((main__x <= 50 && 50 <= main__y) && main__y <= 50)) || (((56 <= main__y && main__x <= 56) && 56 <= main__x) && main__y <= 56)) || (((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x)) || (((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54)) || (((main__x <= 55 && 55 <= main__x) && 55 <= main__y) && main__y <= 55)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (main__x <= 41 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 9) && main__y <= 50 - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 34) && main__y <= 50 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((((((((((((((((((main__y <= 66 && 66 <= main__y) && main__x <= 66) && 66 <= main__x) || ((main__x <= 50 && 50 <= main__y) && main__y <= 50)) || (((56 <= main__y && main__x <= 56) && 56 <= main__x) && main__y <= 56)) || (((59 <= main__y && main__y <= 59) && main__x <= 59) && 59 <= main__x)) || (((main__y <= 58 && 58 <= main__x) && main__x <= 58) && 58 <= main__y)) || (((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54)) || (((60 <= main__y && main__x <= 60) && 60 <= main__x) && main__y <= 60)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52)) || (((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51)) || (((main__x <= 63 && main__y <= 63) && 63 <= main__x) && 63 <= main__y)) || (((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x)) || (((57 <= main__x && 57 <= main__y) && main__x <= 57) && main__y <= 57)) || (((main__x <= 61 && 61 <= main__x) && main__y <= 61) && 61 <= main__y)) || (((62 <= main__x && main__x <= 62) && 62 <= main__y) && main__y <= 62)) || (((64 <= main__x && main__x <= 64) && 64 <= main__y) && main__y <= 64)) || (((main__y <= 65 && 65 <= main__x) && 65 <= main__y) && main__x <= 65)) || (((main__x <= 55 && 55 <= main__x) && 55 <= main__y) && main__y <= 55) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (main__x <= 2 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (main__x <= 27 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: (((((((((((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51) || ((main__x <= 50 && 50 <= main__y) && main__y <= 50)) || (((56 <= main__y && main__x <= 56) && 56 <= main__x) && main__y <= 56)) || (((59 <= main__y && main__y <= 59) && main__x <= 59) && 59 <= main__x)) || (((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x)) || (((57 <= main__x && 57 <= main__y) && main__x <= 57) && main__y <= 57)) || (((main__y <= 58 && 58 <= main__x) && main__x <= 58) && 58 <= main__y)) || (((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54)) || (((main__x <= 55 && 55 <= main__x) && 55 <= main__y) && main__y <= 55)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52) - InvariantResult [Line: 320]: Loop Invariant Derived loop invariant: ((((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51) || ((main__x <= 50 && 50 <= main__y) && main__y <= 50)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (main__x <= 20 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 37) && main__y <= 50 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (main__x <= 5 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (main__x <= 30 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: (((((((((((((main__x <= 50 && 50 <= main__y) && main__y <= 50) || (((56 <= main__y && main__x <= 56) && 56 <= main__x) && main__y <= 56)) || (((59 <= main__y && main__y <= 59) && main__x <= 59) && 59 <= main__x)) || (((main__y <= 58 && 58 <= main__x) && main__x <= 58) && 58 <= main__y)) || (((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54)) || (((60 <= main__y && main__x <= 60) && 60 <= main__x) && main__y <= 60)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52)) || (((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51)) || (((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x)) || (((57 <= main__x && 57 <= main__y) && main__x <= 57) && main__y <= 57)) || (((main__x <= 61 && 61 <= main__x) && main__y <= 61) && 61 <= main__y)) || (((62 <= main__x && main__x <= 62) && 62 <= main__y) && main__y <= 62)) || (((main__x <= 55 && 55 <= main__x) && 55 <= main__y) && main__y <= 55) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (main__x <= 23 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: (((((((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51) || ((main__x <= 50 && 50 <= main__y) && main__y <= 50)) || (((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x)) || (((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52)) || (((main__x <= 55 && 55 <= main__x) && 55 <= main__y) && main__y <= 55) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 48) && main__y <= 50 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (main__x <= 16 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (main__x <= 33 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((((((main__x <= 50 && 50 <= main__y) && main__y <= 50) || (((56 <= main__y && main__x <= 56) && 56 <= main__x) && main__y <= 56)) || (((59 <= main__y && main__y <= 59) && main__x <= 59) && 59 <= main__x)) || (((main__y <= 58 && 58 <= main__x) && main__x <= 58) && 58 <= main__y)) || (((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54)) || (((60 <= main__y && main__x <= 60) && 60 <= main__x) && main__y <= 60)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52)) || (((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51)) || (((main__x <= 63 && main__y <= 63) && 63 <= main__x) && 63 <= main__y)) || (((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x)) || (((57 <= main__x && 57 <= main__y) && main__x <= 57) && main__y <= 57)) || (((main__x <= 61 && 61 <= main__x) && main__y <= 61) && 61 <= main__y)) || (((62 <= main__x && main__x <= 62) && 62 <= main__y) && main__y <= 62)) || (((64 <= main__x && main__x <= 64) && 64 <= main__y) && main__y <= 64)) || (((main__y <= 65 && 65 <= main__x) && 65 <= main__y) && main__x <= 65)) || (((main__x <= 55 && 55 <= main__x) && 55 <= main__y) && main__y <= 55) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (main__x <= 1 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (main__x <= 26 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51) || ((main__x <= 50 && 50 <= main__y) && main__y <= 50)) || (((56 <= main__y && main__x <= 56) && 56 <= main__x) && main__y <= 56)) || (((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x)) || (((57 <= main__x && 57 <= main__y) && main__x <= 57) && main__y <= 57)) || (((main__y <= 58 && 58 <= main__x) && main__x <= 58) && 58 <= main__y)) || (((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52)) || (((main__x <= 55 && 55 <= main__x) && 55 <= main__y) && main__y <= 55) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: (((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51) || ((main__x <= 50 && 50 <= main__y) && main__y <= 50) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (main__x <= 19 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: (main__x <= 44 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (main__x <= 12 && 50 <= main__y) && main__y <= 50 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 1 error locations. Result: SAFE, OverallTime: 278.3s, OverallIterations: 43, TraceHistogramMax: 34, AutomataDifference: 147.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.8s, HoareTripleCheckerStatistics: 2049 SDtfs, 9733 SDslu, 22249 SDs, 0 SdLazy, 349280 SolverSat, 10116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 115.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9041 GetRequests, 5760 SyntacticMatches, 1 SemanticMatches, 3280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2858 ImplicationChecksByTransitivity, 108.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=514occurred in iteration=42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 43 MinimizatonAttempts, 33 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 322 NumberOfFragments, 3103 HoareAnnotationTreeSize, 68 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 68 FomulaSimplificationsInter, 507 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 111.9s InterpolantComputationTime, 12876 NumberOfCodeBlocks, 12876 NumberOfCodeBlocksAsserted, 370 NumberOfCheckSat, 12800 ConstructedInterpolants, 0 QuantifiedInterpolants, 6703612 SizeOfPredicates, 35 NumberOfNonLiveVariables, 13926 ConjunctsInSsa, 2844 ConjunctsInUnsatCore, 76 InterpolantComputations, 10 PerfectInterpolantSequences, 1156/26214 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...