./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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 b54c9d2adb9e977f0950bab67988d354292e80fb ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:15:19,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:15:19,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:15:19,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:15:19,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:15:19,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:15:19,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:15:19,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:15:19,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:15:19,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:15:19,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:15:19,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:15:19,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:15:19,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:15:19,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:15:19,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:15:19,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:15:19,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:15:19,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:15:19,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:15:19,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:15:19,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:15:19,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:15:19,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:15:19,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:15:19,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:15:19,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:15:19,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:15:19,776 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:15:19,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:15:19,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:15:19,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:15:19,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:15:19,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:15:19,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:15:19,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:15:19,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:15:19,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:15:19,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:15:19,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:15:19,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:15:19,780 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:15:19,789 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:15:19,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:15:19,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:15:19,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:15:19,790 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:15:19,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:15:19,791 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:15:19,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:15:19,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:15:19,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:15:19,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:15:19,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:15:19,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:15:19,791 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:15:19,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:15:19,791 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:15:19,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:15:19,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:15:19,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:15:19,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:15:19,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:15:19,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:15:19,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:15:19,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:15:19,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:15:19,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:15:19,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:15:19,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:15:19,793 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:15:19,793 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_be2a652b-81bd-4037-81d0-88dcd54b73bf/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 -> b54c9d2adb9e977f0950bab67988d354292e80fb [2019-12-07 18:15:19,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:15:19,900 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:15:19,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:15:19,904 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:15:19,904 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:15:19,905 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/../../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2019-12-07 18:15:19,943 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/data/6742557dd/d41633af23c34f84aa1f7c59b39433a3/FLAG99b2396ca [2019-12-07 18:15:20,296 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:15:20,296 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2019-12-07 18:15:20,300 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/data/6742557dd/d41633af23c34f84aa1f7c59b39433a3/FLAG99b2396ca [2019-12-07 18:15:20,309 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/data/6742557dd/d41633af23c34f84aa1f7c59b39433a3 [2019-12-07 18:15:20,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:15:20,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:15:20,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:15:20,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:15:20,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:15:20,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:15:20" (1/1) ... [2019-12-07 18:15:20,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23694845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:20, skipping insertion in model container [2019-12-07 18:15:20,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:15:20" (1/1) ... [2019-12-07 18:15:20,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:15:20,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:15:20,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:15:20,451 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:15:20,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:15:20,508 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:15:20,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:20 WrapperNode [2019-12-07 18:15:20,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:15:20,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:15:20,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:15:20,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:15:20,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:20" (1/1) ... [2019-12-07 18:15:20,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:20" (1/1) ... [2019-12-07 18:15:20,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:15:20,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:15:20,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:15:20,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:15:20,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:20" (1/1) ... [2019-12-07 18:15:20,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:20" (1/1) ... [2019-12-07 18:15:20,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:20" (1/1) ... [2019-12-07 18:15:20,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:20" (1/1) ... [2019-12-07 18:15:20,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:20" (1/1) ... [2019-12-07 18:15:20,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:20" (1/1) ... [2019-12-07 18:15:20,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:20" (1/1) ... [2019-12-07 18:15:20,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:15:20,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:15:20,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:15:20,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:15:20,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:15:20,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:15:20,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:15:20,709 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:15:20,709 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:15:20,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:15:20 BoogieIcfgContainer [2019-12-07 18:15:20,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:15:20,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:15:20,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:15:20,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:15:20,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:15:20" (1/3) ... [2019-12-07 18:15:20,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6225e209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:15:20, skipping insertion in model container [2019-12-07 18:15:20,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:15:20" (2/3) ... [2019-12-07 18:15:20,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6225e209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:15:20, skipping insertion in model container [2019-12-07 18:15:20,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:15:20" (3/3) ... [2019-12-07 18:15:20,714 INFO L109 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2019-12-07 18:15:20,721 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:15:20,725 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:15:20,732 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:15:20,747 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:15:20,747 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:15:20,747 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:15:20,747 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:15:20,747 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:15:20,747 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:15:20,747 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:15:20,748 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:15:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-12-07 18:15:20,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 18:15:20,760 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:20,761 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:20,761 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:20,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:20,764 INFO L82 PathProgramCache]: Analyzing trace with hash -265415979, now seen corresponding path program 1 times [2019-12-07 18:15:20,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:20,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819152131] [2019-12-07 18:15:20,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:20,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819152131] [2019-12-07 18:15:20,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:20,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:15:20,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760589465] [2019-12-07 18:15:20,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:15:20,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:20,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:15:20,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:15:20,887 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2019-12-07 18:15:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:20,936 INFO L93 Difference]: Finished difference Result 34 states and 58 transitions. [2019-12-07 18:15:20,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:15:20,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 18:15:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:20,943 INFO L225 Difference]: With dead ends: 34 [2019-12-07 18:15:20,943 INFO L226 Difference]: Without dead ends: 18 [2019-12-07 18:15:20,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:15:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-12-07 18:15:20,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-12-07 18:15:20,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 18:15:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-12-07 18:15:20,967 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 10 [2019-12-07 18:15:20,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:20,967 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-12-07 18:15:20,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:15:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2019-12-07 18:15:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:15:20,967 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:20,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:20,968 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:20,968 INFO L82 PathProgramCache]: Analyzing trace with hash 2136724782, now seen corresponding path program 1 times [2019-12-07 18:15:20,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:20,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888057061] [2019-12-07 18:15:20,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:20,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:20,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888057061] [2019-12-07 18:15:20,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:20,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:15:20,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848284681] [2019-12-07 18:15:20,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:15:20,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:20,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:15:20,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:15:20,993 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. Second operand 4 states. [2019-12-07 18:15:21,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:21,024 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-12-07 18:15:21,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:15:21,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 18:15:21,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:21,025 INFO L225 Difference]: With dead ends: 31 [2019-12-07 18:15:21,025 INFO L226 Difference]: Without dead ends: 18 [2019-12-07 18:15:21,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:15:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-12-07 18:15:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-12-07 18:15:21,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 18:15:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-12-07 18:15:21,029 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2019-12-07 18:15:21,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:21,029 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-12-07 18:15:21,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:15:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2019-12-07 18:15:21,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:15:21,029 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:21,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:21,030 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:21,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:21,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1478184144, now seen corresponding path program 1 times [2019-12-07 18:15:21,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:21,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002103764] [2019-12-07 18:15:21,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:21,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:15:21,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002103764] [2019-12-07 18:15:21,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:21,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:15:21,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334406852] [2019-12-07 18:15:21,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:15:21,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:21,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:15:21,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:15:21,052 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 3 states. [2019-12-07 18:15:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:21,069 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2019-12-07 18:15:21,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:15:21,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 18:15:21,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:21,070 INFO L225 Difference]: With dead ends: 42 [2019-12-07 18:15:21,070 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 18:15:21,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:15:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 18:15:21,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-12-07 18:15:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 18:15:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2019-12-07 18:15:21,074 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 13 [2019-12-07 18:15:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:21,074 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-12-07 18:15:21,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:15:21,074 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2019-12-07 18:15:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:15:21,075 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:21,075 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:21,075 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:21,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:21,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1047433017, now seen corresponding path program 1 times [2019-12-07 18:15:21,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:21,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708577649] [2019-12-07 18:15:21,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:21,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708577649] [2019-12-07 18:15:21,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688468948] [2019-12-07 18:15:21,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:21,162 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:15:21,165 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:21,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:21,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-12-07 18:15:21,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739561932] [2019-12-07 18:15:21,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:15:21,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:21,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:15:21,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:15:21,203 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand 10 states. [2019-12-07 18:15:21,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:21,330 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2019-12-07 18:15:21,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:15:21,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-12-07 18:15:21,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:21,332 INFO L225 Difference]: With dead ends: 70 [2019-12-07 18:15:21,332 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 18:15:21,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:15:21,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 18:15:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 23. [2019-12-07 18:15:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 18:15:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-12-07 18:15:21,340 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2019-12-07 18:15:21,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:21,340 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-12-07 18:15:21,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:15:21,341 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-12-07 18:15:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:15:21,341 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:21,341 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:21,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:21,542 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:21,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:21,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1825215219, now seen corresponding path program 1 times [2019-12-07 18:15:21,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:21,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109935274] [2019-12-07 18:15:21,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 18:15:21,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109935274] [2019-12-07 18:15:21,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:21,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:15:21,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137734845] [2019-12-07 18:15:21,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:15:21,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:21,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:15:21,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:15:21,567 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 3 states. [2019-12-07 18:15:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:21,586 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2019-12-07 18:15:21,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:15:21,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 18:15:21,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:21,587 INFO L225 Difference]: With dead ends: 52 [2019-12-07 18:15:21,587 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 18:15:21,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:15:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 18:15:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-12-07 18:15:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 18:15:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-12-07 18:15:21,590 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2019-12-07 18:15:21,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:21,590 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-12-07 18:15:21,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:15:21,590 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-12-07 18:15:21,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:15:21,591 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:21,591 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:21,591 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:21,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:21,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1882473521, now seen corresponding path program 1 times [2019-12-07 18:15:21,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:21,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664689839] [2019-12-07 18:15:21,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 18:15:21,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664689839] [2019-12-07 18:15:21,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:21,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:15:21,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175610489] [2019-12-07 18:15:21,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:15:21,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:21,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:15:21,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:15:21,613 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 4 states. [2019-12-07 18:15:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:21,631 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2019-12-07 18:15:21,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:15:21,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 18:15:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:21,632 INFO L225 Difference]: With dead ends: 65 [2019-12-07 18:15:21,632 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 18:15:21,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:15:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 18:15:21,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-12-07 18:15:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 18:15:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2019-12-07 18:15:21,637 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 16 [2019-12-07 18:15:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:21,637 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2019-12-07 18:15:21,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:15:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2019-12-07 18:15:21,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:15:21,638 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:21,638 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:21,638 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:21,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:21,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1882533103, now seen corresponding path program 1 times [2019-12-07 18:15:21,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:21,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723443439] [2019-12-07 18:15:21,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:21,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723443439] [2019-12-07 18:15:21,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803243374] [2019-12-07 18:15:21,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:21,692 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:15:21,693 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:21,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:21,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-12-07 18:15:21,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519922096] [2019-12-07 18:15:21,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:15:21,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:21,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:15:21,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:15:21,719 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand 10 states. [2019-12-07 18:15:21,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:21,919 INFO L93 Difference]: Finished difference Result 161 states and 229 transitions. [2019-12-07 18:15:21,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:15:21,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-12-07 18:15:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:21,920 INFO L225 Difference]: With dead ends: 161 [2019-12-07 18:15:21,920 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 18:15:21,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:15:21,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 18:15:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 82. [2019-12-07 18:15:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 18:15:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 109 transitions. [2019-12-07 18:15:21,931 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 109 transitions. Word has length 16 [2019-12-07 18:15:21,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:21,932 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 109 transitions. [2019-12-07 18:15:21,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:15:21,932 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2019-12-07 18:15:21,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:15:21,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:21,932 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:22,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:22,133 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:22,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:22,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1169498870, now seen corresponding path program 2 times [2019-12-07 18:15:22,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:22,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860352401] [2019-12-07 18:15:22,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:22,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860352401] [2019-12-07 18:15:22,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094407550] [2019-12-07 18:15:22,199 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:22,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:15:22,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:15:22,221 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:15:22,222 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:22,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:22,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-12-07 18:15:22,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501955131] [2019-12-07 18:15:22,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:15:22,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:22,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:15:22,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:15:22,265 INFO L87 Difference]: Start difference. First operand 82 states and 109 transitions. Second operand 13 states. [2019-12-07 18:15:22,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:22,383 INFO L93 Difference]: Finished difference Result 221 states and 301 transitions. [2019-12-07 18:15:22,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:15:22,384 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-12-07 18:15:22,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:22,385 INFO L225 Difference]: With dead ends: 221 [2019-12-07 18:15:22,385 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 18:15:22,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:15:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 18:15:22,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 84. [2019-12-07 18:15:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 18:15:22,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2019-12-07 18:15:22,395 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 19 [2019-12-07 18:15:22,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:22,395 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2019-12-07 18:15:22,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:15:22,396 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2019-12-07 18:15:22,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:15:22,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:22,396 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:22,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:22,597 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:22,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:22,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1256265881, now seen corresponding path program 1 times [2019-12-07 18:15:22,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:22,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81888958] [2019-12-07 18:15:22,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:22,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:22,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81888958] [2019-12-07 18:15:22,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500503839] [2019-12-07 18:15:22,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:22,695 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:15:22,697 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:22,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:22,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-12-07 18:15:22,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195132397] [2019-12-07 18:15:22,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:15:22,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:22,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:15:22,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:15:22,750 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand 11 states. [2019-12-07 18:15:22,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:22,789 INFO L93 Difference]: Finished difference Result 197 states and 265 transitions. [2019-12-07 18:15:22,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:15:22,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-12-07 18:15:22,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:22,790 INFO L225 Difference]: With dead ends: 197 [2019-12-07 18:15:22,790 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 18:15:22,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:15:22,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 18:15:22,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 94. [2019-12-07 18:15:22,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 18:15:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2019-12-07 18:15:22,798 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 125 transitions. Word has length 20 [2019-12-07 18:15:22,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:22,798 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 125 transitions. [2019-12-07 18:15:22,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:15:22,798 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions. [2019-12-07 18:15:22,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:15:22,799 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:22,799 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:22,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:23,000 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:23,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:23,001 INFO L82 PathProgramCache]: Analyzing trace with hash 203649807, now seen corresponding path program 3 times [2019-12-07 18:15:23,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:23,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960726603] [2019-12-07 18:15:23,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:23,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960726603] [2019-12-07 18:15:23,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580819443] [2019-12-07 18:15:23,065 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:23,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 18:15:23,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:15:23,084 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:15:23,085 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 18:15:23,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:15:23,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2019-12-07 18:15:23,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234163937] [2019-12-07 18:15:23,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:15:23,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:23,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:15:23,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:15:23,099 INFO L87 Difference]: Start difference. First operand 94 states and 125 transitions. Second operand 4 states. [2019-12-07 18:15:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:23,122 INFO L93 Difference]: Finished difference Result 218 states and 288 transitions. [2019-12-07 18:15:23,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:15:23,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 18:15:23,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:23,123 INFO L225 Difference]: With dead ends: 218 [2019-12-07 18:15:23,123 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 18:15:23,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:15:23,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 18:15:23,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 104. [2019-12-07 18:15:23,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 18:15:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 131 transitions. [2019-12-07 18:15:23,130 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 131 transitions. Word has length 22 [2019-12-07 18:15:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:23,131 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 131 transitions. [2019-12-07 18:15:23,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:15:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2019-12-07 18:15:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:15:23,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:23,131 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:23,332 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:23,333 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:23,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:23,333 INFO L82 PathProgramCache]: Analyzing trace with hash -617261500, now seen corresponding path program 2 times [2019-12-07 18:15:23,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:23,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201712360] [2019-12-07 18:15:23,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:23,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201712360] [2019-12-07 18:15:23,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298269600] [2019-12-07 18:15:23,390 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:23,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:15:23,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:15:23,409 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:15:23,410 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:23,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:23,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-12-07 18:15:23,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776802446] [2019-12-07 18:15:23,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:15:23,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:23,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:15:23,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:15:23,442 INFO L87 Difference]: Start difference. First operand 104 states and 131 transitions. Second operand 13 states. [2019-12-07 18:15:23,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:23,503 INFO L93 Difference]: Finished difference Result 249 states and 317 transitions. [2019-12-07 18:15:23,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:15:23,503 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-12-07 18:15:23,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:23,504 INFO L225 Difference]: With dead ends: 249 [2019-12-07 18:15:23,504 INFO L226 Difference]: Without dead ends: 147 [2019-12-07 18:15:23,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:15:23,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-07 18:15:23,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 126. [2019-12-07 18:15:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 18:15:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 157 transitions. [2019-12-07 18:15:23,511 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 157 transitions. Word has length 23 [2019-12-07 18:15:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:23,511 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 157 transitions. [2019-12-07 18:15:23,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:15:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 157 transitions. [2019-12-07 18:15:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:15:23,512 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:23,512 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:23,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:23,713 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:23,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:23,714 INFO L82 PathProgramCache]: Analyzing trace with hash 667196999, now seen corresponding path program 3 times [2019-12-07 18:15:23,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:23,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366969808] [2019-12-07 18:15:23,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:23,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366969808] [2019-12-07 18:15:23,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693249022] [2019-12-07 18:15:23,776 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:23,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 18:15:23,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:15:23,798 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 18:15:23,799 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:23,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:15:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 18:15:23,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:15:23,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2019-12-07 18:15:23,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329795649] [2019-12-07 18:15:23,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:15:23,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:23,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:15:23,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:15:23,869 INFO L87 Difference]: Start difference. First operand 126 states and 157 transitions. Second operand 8 states. [2019-12-07 18:15:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:23,946 INFO L93 Difference]: Finished difference Result 280 states and 347 transitions. [2019-12-07 18:15:23,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:15:23,946 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-12-07 18:15:23,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:23,948 INFO L225 Difference]: With dead ends: 280 [2019-12-07 18:15:23,948 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 18:15:23,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:15:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 18:15:23,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 175. [2019-12-07 18:15:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-12-07 18:15:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2019-12-07 18:15:23,963 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 26 [2019-12-07 18:15:23,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:23,964 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 216 transitions. [2019-12-07 18:15:23,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:15:23,964 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2019-12-07 18:15:23,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:15:23,965 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:23,965 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:24,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:24,166 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:24,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:24,167 INFO L82 PathProgramCache]: Analyzing trace with hash 475238213, now seen corresponding path program 1 times [2019-12-07 18:15:24,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:24,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263352594] [2019-12-07 18:15:24,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:24,203 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 18:15:24,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263352594] [2019-12-07 18:15:24,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:15:24,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:15:24,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088865114] [2019-12-07 18:15:24,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:15:24,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:24,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:15:24,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:15:24,206 INFO L87 Difference]: Start difference. First operand 175 states and 216 transitions. Second operand 4 states. [2019-12-07 18:15:24,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:24,247 INFO L93 Difference]: Finished difference Result 260 states and 323 transitions. [2019-12-07 18:15:24,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:15:24,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-07 18:15:24,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:24,251 INFO L225 Difference]: With dead ends: 260 [2019-12-07 18:15:24,251 INFO L226 Difference]: Without dead ends: 194 [2019-12-07 18:15:24,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:15:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-12-07 18:15:24,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2019-12-07 18:15:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-12-07 18:15:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 222 transitions. [2019-12-07 18:15:24,272 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 222 transitions. Word has length 26 [2019-12-07 18:15:24,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:24,273 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 222 transitions. [2019-12-07 18:15:24,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:15:24,273 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 222 transitions. [2019-12-07 18:15:24,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:15:24,274 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:24,275 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:24,275 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:24,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:24,275 INFO L82 PathProgramCache]: Analyzing trace with hash 477144837, now seen corresponding path program 1 times [2019-12-07 18:15:24,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:24,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923833791] [2019-12-07 18:15:24,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:15:24,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923833791] [2019-12-07 18:15:24,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982174804] [2019-12-07 18:15:24,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:24,364 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:15:24,365 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:24,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:24,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-12-07 18:15:24,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553627476] [2019-12-07 18:15:24,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:15:24,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:24,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:15:24,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:15:24,425 INFO L87 Difference]: Start difference. First operand 181 states and 222 transitions. Second operand 15 states. [2019-12-07 18:15:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:24,668 INFO L93 Difference]: Finished difference Result 483 states and 604 transitions. [2019-12-07 18:15:24,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 18:15:24,668 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-12-07 18:15:24,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:24,670 INFO L225 Difference]: With dead ends: 483 [2019-12-07 18:15:24,670 INFO L226 Difference]: Without dead ends: 337 [2019-12-07 18:15:24,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=614, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:15:24,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-12-07 18:15:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 205. [2019-12-07 18:15:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-12-07 18:15:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 251 transitions. [2019-12-07 18:15:24,685 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 251 transitions. Word has length 26 [2019-12-07 18:15:24,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:24,685 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 251 transitions. [2019-12-07 18:15:24,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:15:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 251 transitions. [2019-12-07 18:15:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:15:24,686 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:24,686 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:24,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:24,887 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:24,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:24,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2135503200, now seen corresponding path program 2 times [2019-12-07 18:15:24,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:24,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106192700] [2019-12-07 18:15:24,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:15:24,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106192700] [2019-12-07 18:15:24,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932993267] [2019-12-07 18:15:24,994 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:25,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:15:25,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:15:25,034 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:15:25,036 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:15:25,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:25,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-12-07 18:15:25,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863877163] [2019-12-07 18:15:25,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 18:15:25,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:25,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 18:15:25,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:15:25,145 INFO L87 Difference]: Start difference. First operand 205 states and 251 transitions. Second operand 17 states. [2019-12-07 18:15:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:25,279 INFO L93 Difference]: Finished difference Result 424 states and 525 transitions. [2019-12-07 18:15:25,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:15:25,279 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-12-07 18:15:25,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:25,281 INFO L225 Difference]: With dead ends: 424 [2019-12-07 18:15:25,281 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 18:15:25,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:15:25,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 18:15:25,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 199. [2019-12-07 18:15:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-12-07 18:15:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 245 transitions. [2019-12-07 18:15:25,295 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 245 transitions. Word has length 29 [2019-12-07 18:15:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:25,295 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 245 transitions. [2019-12-07 18:15:25,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 18:15:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 245 transitions. [2019-12-07 18:15:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:15:25,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:25,296 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:25,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:25,497 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:25,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:25,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1548697186, now seen corresponding path program 3 times [2019-12-07 18:15:25,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:25,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133796453] [2019-12-07 18:15:25,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:25,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133796453] [2019-12-07 18:15:25,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563466596] [2019-12-07 18:15:25,585 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:25,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 18:15:25,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:15:25,607 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 18:15:25,608 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:25,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:15:25,681 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 18:15:25,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:15:25,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2019-12-07 18:15:25,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796205920] [2019-12-07 18:15:25,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:15:25,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:25,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:15:25,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:15:25,682 INFO L87 Difference]: Start difference. First operand 199 states and 245 transitions. Second operand 8 states. [2019-12-07 18:15:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:25,775 INFO L93 Difference]: Finished difference Result 258 states and 315 transitions. [2019-12-07 18:15:25,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:15:25,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-07 18:15:25,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:25,777 INFO L225 Difference]: With dead ends: 258 [2019-12-07 18:15:25,777 INFO L226 Difference]: Without dead ends: 256 [2019-12-07 18:15:25,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:15:25,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-12-07 18:15:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 199. [2019-12-07 18:15:25,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-12-07 18:15:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 245 transitions. [2019-12-07 18:15:25,786 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 245 transitions. Word has length 29 [2019-12-07 18:15:25,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:25,787 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 245 transitions. [2019-12-07 18:15:25,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:15:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 245 transitions. [2019-12-07 18:15:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:15:25,787 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:25,787 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:25,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:25,988 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:25,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:25,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1366196382, now seen corresponding path program 2 times [2019-12-07 18:15:25,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:25,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983711459] [2019-12-07 18:15:25,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:26,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983711459] [2019-12-07 18:15:26,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585032334] [2019-12-07 18:15:26,067 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:15:26,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 18:15:26,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:15:26,087 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:15:26,088 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-07 18:15:26,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:15:26,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2019-12-07 18:15:26,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901577993] [2019-12-07 18:15:26,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:15:26,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:26,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:15:26,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:15:26,111 INFO L87 Difference]: Start difference. First operand 199 states and 245 transitions. Second operand 5 states. [2019-12-07 18:15:26,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:26,138 INFO L93 Difference]: Finished difference Result 345 states and 426 transitions. [2019-12-07 18:15:26,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:15:26,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 18:15:26,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:26,140 INFO L225 Difference]: With dead ends: 345 [2019-12-07 18:15:26,140 INFO L226 Difference]: Without dead ends: 273 [2019-12-07 18:15:26,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:15:26,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-12-07 18:15:26,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 231. [2019-12-07 18:15:26,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-12-07 18:15:26,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 286 transitions. [2019-12-07 18:15:26,155 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 286 transitions. Word has length 29 [2019-12-07 18:15:26,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:26,155 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 286 transitions. [2019-12-07 18:15:26,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:15:26,155 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 286 transitions. [2019-12-07 18:15:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 18:15:26,156 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:26,156 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 18:15:26,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:26,357 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:26,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:26,357 INFO L82 PathProgramCache]: Analyzing trace with hash 531419276, now seen corresponding path program 1 times [2019-12-07 18:15:26,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:26,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537057888] [2019-12-07 18:15:26,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 34 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:26,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537057888] [2019-12-07 18:15:26,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059068022] [2019-12-07 18:15:26,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:15:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:26,520 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:15:26,522 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 122 proven. 51 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 18:15:26,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:26,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 25 [2019-12-07 18:15:26,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723845586] [2019-12-07 18:15:26,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 18:15:26,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:26,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 18:15:26,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2019-12-07 18:15:26,615 INFO L87 Difference]: Start difference. First operand 231 states and 286 transitions. Second operand 26 states. [2019-12-07 18:15:26,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:26,851 INFO L93 Difference]: Finished difference Result 551 states and 679 transitions. [2019-12-07 18:15:26,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:15:26,851 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-12-07 18:15:26,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:26,853 INFO L225 Difference]: With dead ends: 551 [2019-12-07 18:15:26,853 INFO L226 Difference]: Without dead ends: 359 [2019-12-07 18:15:26,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=308, Invalid=1098, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 18:15:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-12-07 18:15:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 266. [2019-12-07 18:15:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 18:15:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 327 transitions. [2019-12-07 18:15:26,865 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 327 transitions. Word has length 55 [2019-12-07 18:15:26,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:26,865 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 327 transitions. [2019-12-07 18:15:26,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 18:15:26,865 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 327 transitions. [2019-12-07 18:15:26,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 18:15:26,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:26,866 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 18:15:27,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:27,067 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:27,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:27,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1993539556, now seen corresponding path program 2 times [2019-12-07 18:15:27,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:27,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117338320] [2019-12-07 18:15:27,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:27,230 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 39 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:27,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117338320] [2019-12-07 18:15:27,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390746220] [2019-12-07 18:15:27,230 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:15:27,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:15:27,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:15:27,254 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:15:27,255 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 163 proven. 70 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-12-07 18:15:27,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:27,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 28 [2019-12-07 18:15:27,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138489970] [2019-12-07 18:15:27,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 18:15:27,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:27,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 18:15:27,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2019-12-07 18:15:27,346 INFO L87 Difference]: Start difference. First operand 266 states and 327 transitions. Second operand 29 states. [2019-12-07 18:15:27,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:27,662 INFO L93 Difference]: Finished difference Result 644 states and 783 transitions. [2019-12-07 18:15:27,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 18:15:27,662 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 61 [2019-12-07 18:15:27,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:27,664 INFO L225 Difference]: With dead ends: 644 [2019-12-07 18:15:27,665 INFO L226 Difference]: Without dead ends: 425 [2019-12-07 18:15:27,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=437, Invalid=1543, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 18:15:27,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-12-07 18:15:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 305. [2019-12-07 18:15:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-12-07 18:15:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 372 transitions. [2019-12-07 18:15:27,685 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 372 transitions. Word has length 61 [2019-12-07 18:15:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:27,685 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 372 transitions. [2019-12-07 18:15:27,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 18:15:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 372 transitions. [2019-12-07 18:15:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:15:27,686 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:27,686 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 14, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 18:15:27,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:27,887 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:27,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:27,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1561582796, now seen corresponding path program 3 times [2019-12-07 18:15:27,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:27,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256700636] [2019-12-07 18:15:27,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:28,058 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 44 proven. 356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:28,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256700636] [2019-12-07 18:15:28,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970876518] [2019-12-07 18:15:28,058 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:15:28,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 18:15:28,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:15:28,080 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 18:15:28,081 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:28,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:15:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 22 proven. 216 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-12-07 18:15:28,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:28,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9] total 30 [2019-12-07 18:15:28,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643382158] [2019-12-07 18:15:28,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 18:15:28,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:28,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 18:15:28,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:15:28,182 INFO L87 Difference]: Start difference. First operand 305 states and 372 transitions. Second operand 30 states. [2019-12-07 18:15:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:31,655 INFO L93 Difference]: Finished difference Result 1614 states and 1904 transitions. [2019-12-07 18:15:31,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-12-07 18:15:31,655 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-12-07 18:15:31,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:31,662 INFO L225 Difference]: With dead ends: 1614 [2019-12-07 18:15:31,662 INFO L226 Difference]: Without dead ends: 1512 [2019-12-07 18:15:31,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11671 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4550, Invalid=24180, Unknown=0, NotChecked=0, Total=28730 [2019-12-07 18:15:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2019-12-07 18:15:31,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 644. [2019-12-07 18:15:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-12-07 18:15:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 755 transitions. [2019-12-07 18:15:31,720 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 755 transitions. Word has length 67 [2019-12-07 18:15:31,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:31,720 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 755 transitions. [2019-12-07 18:15:31,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 18:15:31,720 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 755 transitions. [2019-12-07 18:15:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:15:31,721 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:31,721 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 10, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:31,921 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:31,921 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:31,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:31,921 INFO L82 PathProgramCache]: Analyzing trace with hash -577843254, now seen corresponding path program 1 times [2019-12-07 18:15:31,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:31,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436887333] [2019-12-07 18:15:31,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 26 proven. 374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:32,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436887333] [2019-12-07 18:15:32,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722536624] [2019-12-07 18:15:32,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:15:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:32,181 INFO L264 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 18:15:32,182 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 92 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-12-07 18:15:32,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:32,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 11] total 34 [2019-12-07 18:15:32,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230231729] [2019-12-07 18:15:32,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 18:15:32,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:32,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 18:15:32,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=982, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 18:15:32,321 INFO L87 Difference]: Start difference. First operand 644 states and 755 transitions. Second operand 35 states. [2019-12-07 18:15:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:34,319 INFO L93 Difference]: Finished difference Result 2064 states and 2515 transitions. [2019-12-07 18:15:34,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-12-07 18:15:34,320 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-12-07 18:15:34,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:34,325 INFO L225 Difference]: With dead ends: 2064 [2019-12-07 18:15:34,325 INFO L226 Difference]: Without dead ends: 1493 [2019-12-07 18:15:34,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4387 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2552, Invalid=11728, Unknown=0, NotChecked=0, Total=14280 [2019-12-07 18:15:34,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2019-12-07 18:15:34,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 501. [2019-12-07 18:15:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-12-07 18:15:34,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 608 transitions. [2019-12-07 18:15:34,357 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 608 transitions. Word has length 67 [2019-12-07 18:15:34,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:34,357 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 608 transitions. [2019-12-07 18:15:34,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 18:15:34,357 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 608 transitions. [2019-12-07 18:15:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 18:15:34,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:34,357 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 12, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:34,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:34,558 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:34,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:34,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2091458462, now seen corresponding path program 2 times [2019-12-07 18:15:34,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:34,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651641089] [2019-12-07 18:15:34,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:34,804 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 34 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:34,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651641089] [2019-12-07 18:15:34,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800056902] [2019-12-07 18:15:34,805 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:15:34,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:15:34,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:15:34,831 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 18:15:34,832 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 263 proven. 117 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-12-07 18:15:34,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:34,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 12] total 37 [2019-12-07 18:15:34,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146250760] [2019-12-07 18:15:34,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 18:15:34,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:34,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 18:15:35,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1168, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 18:15:35,000 INFO L87 Difference]: Start difference. First operand 501 states and 608 transitions. Second operand 38 states. [2019-12-07 18:15:37,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:37,525 INFO L93 Difference]: Finished difference Result 1888 states and 2315 transitions. [2019-12-07 18:15:37,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-12-07 18:15:37,526 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2019-12-07 18:15:37,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:37,532 INFO L225 Difference]: With dead ends: 1888 [2019-12-07 18:15:37,532 INFO L226 Difference]: Without dead ends: 1452 [2019-12-07 18:15:37,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5281 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3026, Invalid=14004, Unknown=0, NotChecked=0, Total=17030 [2019-12-07 18:15:37,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2019-12-07 18:15:37,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 558. [2019-12-07 18:15:37,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-12-07 18:15:37,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 674 transitions. [2019-12-07 18:15:37,573 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 674 transitions. Word has length 73 [2019-12-07 18:15:37,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:37,573 INFO L462 AbstractCegarLoop]: Abstraction has 558 states and 674 transitions. [2019-12-07 18:15:37,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 18:15:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 674 transitions. [2019-12-07 18:15:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 18:15:37,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:37,574 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 14, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:37,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:37,775 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:37,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:37,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2051483018, now seen corresponding path program 3 times [2019-12-07 18:15:37,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:37,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547955487] [2019-12-07 18:15:37,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 45 proven. 573 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:15:38,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547955487] [2019-12-07 18:15:38,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856310286] [2019-12-07 18:15:38,052 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:15:38,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 18:15:38,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:15:38,072 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:15:38,073 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 355 proven. 1 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-12-07 18:15:38,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:38,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 8] total 36 [2019-12-07 18:15:38,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962099459] [2019-12-07 18:15:38,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 18:15:38,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:38,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 18:15:38,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 18:15:38,184 INFO L87 Difference]: Start difference. First operand 558 states and 674 transitions. Second operand 36 states. [2019-12-07 18:15:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:42,083 INFO L93 Difference]: Finished difference Result 1347 states and 1622 transitions. [2019-12-07 18:15:42,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-12-07 18:15:42,083 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2019-12-07 18:15:42,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:42,087 INFO L225 Difference]: With dead ends: 1347 [2019-12-07 18:15:42,087 INFO L226 Difference]: Without dead ends: 952 [2019-12-07 18:15:42,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6788 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3236, Invalid=17356, Unknown=0, NotChecked=0, Total=20592 [2019-12-07 18:15:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-12-07 18:15:42,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 691. [2019-12-07 18:15:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-12-07 18:15:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 788 transitions. [2019-12-07 18:15:42,132 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 788 transitions. Word has length 79 [2019-12-07 18:15:42,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:42,133 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 788 transitions. [2019-12-07 18:15:42,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 18:15:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 788 transitions. [2019-12-07 18:15:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 18:15:42,134 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:42,134 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:42,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:42,334 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:42,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:42,335 INFO L82 PathProgramCache]: Analyzing trace with hash -741345910, now seen corresponding path program 4 times [2019-12-07 18:15:42,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:42,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791942440] [2019-12-07 18:15:42,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 31 proven. 547 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 18:15:42,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791942440] [2019-12-07 18:15:42,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444252948] [2019-12-07 18:15:42,507 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:15:42,529 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 18:15:42,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:15:42,531 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 18:15:42,531 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 297 proven. 295 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 18:15:42,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:42,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 41 [2019-12-07 18:15:42,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279190609] [2019-12-07 18:15:42,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 18:15:42,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:42,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 18:15:42,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1435, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 18:15:42,817 INFO L87 Difference]: Start difference. First operand 691 states and 788 transitions. Second operand 41 states. [2019-12-07 18:15:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:45,799 INFO L93 Difference]: Finished difference Result 1706 states and 1934 transitions. [2019-12-07 18:15:45,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-12-07 18:15:45,799 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-12-07 18:15:45,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:45,803 INFO L225 Difference]: With dead ends: 1706 [2019-12-07 18:15:45,803 INFO L226 Difference]: Without dead ends: 1228 [2019-12-07 18:15:45,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4517 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2905, Invalid=13097, Unknown=0, NotChecked=0, Total=16002 [2019-12-07 18:15:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-07 18:15:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 464. [2019-12-07 18:15:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-12-07 18:15:45,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 532 transitions. [2019-12-07 18:15:45,836 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 532 transitions. Word has length 79 [2019-12-07 18:15:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:45,836 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 532 transitions. [2019-12-07 18:15:45,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 18:15:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 532 transitions. [2019-12-07 18:15:45,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 18:15:45,837 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:45,837 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 15, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 18:15:46,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:46,038 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:46,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:46,038 INFO L82 PathProgramCache]: Analyzing trace with hash -216004410, now seen corresponding path program 1 times [2019-12-07 18:15:46,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:46,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455915293] [2019-12-07 18:15:46,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 103 proven. 513 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:15:46,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455915293] [2019-12-07 18:15:46,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198216601] [2019-12-07 18:15:46,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:15:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:46,387 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 18:15:46,388 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 322 proven. 145 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-12-07 18:15:46,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:46,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13] total 40 [2019-12-07 18:15:46,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115410696] [2019-12-07 18:15:46,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 18:15:46,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:46,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 18:15:46,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1402, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 18:15:46,594 INFO L87 Difference]: Start difference. First operand 464 states and 532 transitions. Second operand 41 states. [2019-12-07 18:15:49,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:49,961 INFO L93 Difference]: Finished difference Result 1055 states and 1220 transitions. [2019-12-07 18:15:49,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-12-07 18:15:49,962 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-12-07 18:15:49,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:49,965 INFO L225 Difference]: With dead ends: 1055 [2019-12-07 18:15:49,965 INFO L226 Difference]: Without dead ends: 609 [2019-12-07 18:15:49,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4014 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2656, Invalid=10226, Unknown=0, NotChecked=0, Total=12882 [2019-12-07 18:15:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-07 18:15:50,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 544. [2019-12-07 18:15:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-12-07 18:15:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 620 transitions. [2019-12-07 18:15:50,003 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 620 transitions. Word has length 79 [2019-12-07 18:15:50,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:50,003 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 620 transitions. [2019-12-07 18:15:50,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 18:15:50,004 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 620 transitions. [2019-12-07 18:15:50,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 18:15:50,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:50,005 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 12, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:50,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:50,205 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:50,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:50,206 INFO L82 PathProgramCache]: Analyzing trace with hash 600454234, now seen corresponding path program 5 times [2019-12-07 18:15:50,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:50,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281527229] [2019-12-07 18:15:50,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:50,393 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 31 proven. 657 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 18:15:50,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281527229] [2019-12-07 18:15:50,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281329502] [2019-12-07 18:15:50,393 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:15:50,425 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-12-07 18:15:50,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:15:50,426 INFO L264 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 18:15:50,427 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 387 proven. 176 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-12-07 18:15:50,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:50,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 35 [2019-12-07 18:15:50,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280375673] [2019-12-07 18:15:50,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 18:15:50,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:50,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 18:15:50,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 18:15:50,603 INFO L87 Difference]: Start difference. First operand 544 states and 620 transitions. Second operand 36 states. [2019-12-07 18:15:51,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:51,015 INFO L93 Difference]: Finished difference Result 1116 states and 1284 transitions. [2019-12-07 18:15:51,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 18:15:51,016 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 85 [2019-12-07 18:15:51,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:51,018 INFO L225 Difference]: With dead ends: 1116 [2019-12-07 18:15:51,018 INFO L226 Difference]: Without dead ends: 657 [2019-12-07 18:15:51,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=763, Invalid=2543, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 18:15:51,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-12-07 18:15:51,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 592. [2019-12-07 18:15:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-12-07 18:15:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 671 transitions. [2019-12-07 18:15:51,049 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 671 transitions. Word has length 85 [2019-12-07 18:15:51,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:51,050 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 671 transitions. [2019-12-07 18:15:51,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 18:15:51,050 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 671 transitions. [2019-12-07 18:15:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 18:15:51,050 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:51,050 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 12, 12, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:15:51,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:51,251 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:51,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:51,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1846584762, now seen corresponding path program 6 times [2019-12-07 18:15:51,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:51,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92686183] [2019-12-07 18:15:51,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 45 proven. 782 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 18:15:51,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92686183] [2019-12-07 18:15:51,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295165038] [2019-12-07 18:15:51,479 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:15:51,508 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-07 18:15:51,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:15:51,509 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 18:15:51,510 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:51,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:15:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 34 proven. 464 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-12-07 18:15:51,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:51,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 9] total 33 [2019-12-07 18:15:51,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136026556] [2019-12-07 18:15:51,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 18:15:51,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:51,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 18:15:51,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 18:15:51,642 INFO L87 Difference]: Start difference. First operand 592 states and 671 transitions. Second operand 33 states. [2019-12-07 18:15:57,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:57,446 INFO L93 Difference]: Finished difference Result 1813 states and 2060 transitions. [2019-12-07 18:15:57,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-12-07 18:15:57,447 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 91 [2019-12-07 18:15:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:57,456 INFO L225 Difference]: With dead ends: 1813 [2019-12-07 18:15:57,456 INFO L226 Difference]: Without dead ends: 1509 [2019-12-07 18:15:57,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11608 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4196, Invalid=26254, Unknown=0, NotChecked=0, Total=30450 [2019-12-07 18:15:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2019-12-07 18:15:57,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 703. [2019-12-07 18:15:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-12-07 18:15:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 799 transitions. [2019-12-07 18:15:57,510 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 799 transitions. Word has length 91 [2019-12-07 18:15:57,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:57,510 INFO L462 AbstractCegarLoop]: Abstraction has 703 states and 799 transitions. [2019-12-07 18:15:57,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 18:15:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 799 transitions. [2019-12-07 18:15:57,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 18:15:57,511 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:57,511 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 18, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 18:15:57,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:57,712 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:57,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:57,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1046927688, now seen corresponding path program 2 times [2019-12-07 18:15:57,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:57,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495435548] [2019-12-07 18:15:57,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 166 proven. 716 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:15:58,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495435548] [2019-12-07 18:15:58,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956495338] [2019-12-07 18:15:58,086 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:15:58,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:15:58,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:15:58,113 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 18:15:58,114 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:15:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 6 proven. 469 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-12-07 18:15:58,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:15:58,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12] total 43 [2019-12-07 18:15:58,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305775355] [2019-12-07 18:15:58,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-07 18:15:58,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:15:58,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-07 18:15:58,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1639, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 18:15:58,304 INFO L87 Difference]: Start difference. First operand 703 states and 799 transitions. Second operand 44 states. [2019-12-07 18:15:59,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:15:59,382 INFO L93 Difference]: Finished difference Result 1274 states and 1456 transitions. [2019-12-07 18:15:59,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-07 18:15:59,383 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 91 [2019-12-07 18:15:59,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:15:59,386 INFO L225 Difference]: With dead ends: 1274 [2019-12-07 18:15:59,386 INFO L226 Difference]: Without dead ends: 927 [2019-12-07 18:15:59,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2563 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1417, Invalid=7139, Unknown=0, NotChecked=0, Total=8556 [2019-12-07 18:15:59,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-12-07 18:15:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 809. [2019-12-07 18:15:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2019-12-07 18:15:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 927 transitions. [2019-12-07 18:15:59,430 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 927 transitions. Word has length 91 [2019-12-07 18:15:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:15:59,430 INFO L462 AbstractCegarLoop]: Abstraction has 809 states and 927 transitions. [2019-12-07 18:15:59,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-07 18:15:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 927 transitions. [2019-12-07 18:15:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 18:15:59,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:15:59,431 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 19, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 18:15:59,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:15:59,632 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:15:59,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:15:59,632 INFO L82 PathProgramCache]: Analyzing trace with hash 314960262, now seen corresponding path program 3 times [2019-12-07 18:15:59,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:15:59,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904230789] [2019-12-07 18:15:59,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:15:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:15:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 152 proven. 730 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:15:59,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904230789] [2019-12-07 18:15:59,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726887675] [2019-12-07 18:15:59,993 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:16:00,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 18:16:00,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:16:00,013 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 18:16:00,014 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:00,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:00,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:00,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:00,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-12-07 18:16:00,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:16:00,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 9] total 41 [2019-12-07 18:16:00,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287396183] [2019-12-07 18:16:00,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 18:16:00,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:00,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 18:16:00,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1460, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 18:16:00,203 INFO L87 Difference]: Start difference. First operand 809 states and 927 transitions. Second operand 41 states. [2019-12-07 18:16:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:06,792 INFO L93 Difference]: Finished difference Result 1477 states and 1638 transitions. [2019-12-07 18:16:06,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-12-07 18:16:06,793 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 91 [2019-12-07 18:16:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:06,797 INFO L225 Difference]: With dead ends: 1477 [2019-12-07 18:16:06,797 INFO L226 Difference]: Without dead ends: 1238 [2019-12-07 18:16:06,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12933 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5869, Invalid=30041, Unknown=0, NotChecked=0, Total=35910 [2019-12-07 18:16:06,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-12-07 18:16:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 887. [2019-12-07 18:16:06,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-12-07 18:16:06,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1011 transitions. [2019-12-07 18:16:06,848 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1011 transitions. Word has length 91 [2019-12-07 18:16:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:06,848 INFO L462 AbstractCegarLoop]: Abstraction has 887 states and 1011 transitions. [2019-12-07 18:16:06,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 18:16:06,848 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1011 transitions. [2019-12-07 18:16:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 18:16:06,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:06,849 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 21, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:07,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:07,050 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:07,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:07,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1277696966, now seen corresponding path program 1 times [2019-12-07 18:16:07,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:07,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968622900] [2019-12-07 18:16:07,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:07,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968622900] [2019-12-07 18:16:07,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292810643] [2019-12-07 18:16:07,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:16:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:07,537 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 18:16:07,538 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 458 proven. 210 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-12-07 18:16:07,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:16:07,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 15] total 50 [2019-12-07 18:16:07,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256763200] [2019-12-07 18:16:07,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-12-07 18:16:07,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:07,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-12-07 18:16:07,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=2160, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 18:16:07,787 INFO L87 Difference]: Start difference. First operand 887 states and 1011 transitions. Second operand 51 states. [2019-12-07 18:16:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:14,265 INFO L93 Difference]: Finished difference Result 2514 states and 2913 transitions. [2019-12-07 18:16:14,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2019-12-07 18:16:14,265 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 91 [2019-12-07 18:16:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:14,270 INFO L225 Difference]: With dead ends: 2514 [2019-12-07 18:16:14,270 INFO L226 Difference]: Without dead ends: 1729 [2019-12-07 18:16:14,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15194 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=9076, Invalid=33980, Unknown=0, NotChecked=0, Total=43056 [2019-12-07 18:16:14,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2019-12-07 18:16:14,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1086. [2019-12-07 18:16:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2019-12-07 18:16:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1247 transitions. [2019-12-07 18:16:14,336 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1247 transitions. Word has length 91 [2019-12-07 18:16:14,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:14,336 INFO L462 AbstractCegarLoop]: Abstraction has 1086 states and 1247 transitions. [2019-12-07 18:16:14,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-12-07 18:16:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1247 transitions. [2019-12-07 18:16:14,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 18:16:14,337 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:14,337 INFO L410 BasicCegarLoop]: trace histogram [26, 26, 22, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:14,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:14,538 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:14,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:14,538 INFO L82 PathProgramCache]: Analyzing trace with hash 763529758, now seen corresponding path program 7 times [2019-12-07 18:16:14,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:14,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365744695] [2019-12-07 18:16:14,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 171 proven. 864 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:14,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365744695] [2019-12-07 18:16:14,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904699144] [2019-12-07 18:16:14,958 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:16:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:14,984 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 18:16:14,985 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:15,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 535 proven. 247 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-12-07 18:16:15,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:16:15,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 16] total 51 [2019-12-07 18:16:15,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272745323] [2019-12-07 18:16:15,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-12-07 18:16:15,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:15,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-12-07 18:16:15,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2278, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 18:16:15,280 INFO L87 Difference]: Start difference. First operand 1086 states and 1247 transitions. Second operand 52 states. [2019-12-07 18:16:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:30,239 INFO L93 Difference]: Finished difference Result 2867 states and 3266 transitions. [2019-12-07 18:16:30,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2019-12-07 18:16:30,240 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 97 [2019-12-07 18:16:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:30,245 INFO L225 Difference]: With dead ends: 2867 [2019-12-07 18:16:30,245 INFO L226 Difference]: Without dead ends: 1843 [2019-12-07 18:16:30,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24179 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=11872, Invalid=53408, Unknown=0, NotChecked=0, Total=65280 [2019-12-07 18:16:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2019-12-07 18:16:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1097. [2019-12-07 18:16:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-12-07 18:16:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1253 transitions. [2019-12-07 18:16:30,315 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1253 transitions. Word has length 97 [2019-12-07 18:16:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:30,315 INFO L462 AbstractCegarLoop]: Abstraction has 1097 states and 1253 transitions. [2019-12-07 18:16:30,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-12-07 18:16:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1253 transitions. [2019-12-07 18:16:30,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 18:16:30,316 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:30,316 INFO L410 BasicCegarLoop]: trace histogram [28, 28, 24, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:30,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:30,516 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:30,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:30,517 INFO L82 PathProgramCache]: Analyzing trace with hash -850803962, now seen corresponding path program 8 times [2019-12-07 18:16:30,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:30,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634161742] [2019-12-07 18:16:30,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 203 proven. 995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:30,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634161742] [2019-12-07 18:16:30,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425288621] [2019-12-07 18:16:30,980 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:16:31,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:16:31,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:16:31,009 INFO L264 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 18:16:31,010 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 618 proven. 287 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-12-07 18:16:31,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:16:31,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 17] total 54 [2019-12-07 18:16:31,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362703970] [2019-12-07 18:16:31,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-12-07 18:16:31,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:31,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-12-07 18:16:31,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=2543, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 18:16:31,339 INFO L87 Difference]: Start difference. First operand 1097 states and 1253 transitions. Second operand 55 states. [2019-12-07 18:16:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:42,316 INFO L93 Difference]: Finished difference Result 3278 states and 3733 transitions. [2019-12-07 18:16:42,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-12-07 18:16:42,316 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 103 [2019-12-07 18:16:42,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:42,323 INFO L225 Difference]: With dead ends: 3278 [2019-12-07 18:16:42,323 INFO L226 Difference]: Without dead ends: 2127 [2019-12-07 18:16:42,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29935 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=14766, Invalid=65606, Unknown=0, NotChecked=0, Total=80372 [2019-12-07 18:16:42,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2019-12-07 18:16:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1172. [2019-12-07 18:16:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-12-07 18:16:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1335 transitions. [2019-12-07 18:16:42,406 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1335 transitions. Word has length 103 [2019-12-07 18:16:42,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:42,406 INFO L462 AbstractCegarLoop]: Abstraction has 1172 states and 1335 transitions. [2019-12-07 18:16:42,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-12-07 18:16:42,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1335 transitions. [2019-12-07 18:16:42,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 18:16:42,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:42,408 INFO L410 BasicCegarLoop]: trace histogram [30, 30, 26, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:42,608 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:42,608 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:42,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:42,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1300881630, now seen corresponding path program 9 times [2019-12-07 18:16:42,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:42,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703980536] [2019-12-07 18:16:42,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 238 proven. 1135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:43,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703980536] [2019-12-07 18:16:43,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72741231] [2019-12-07 18:16:43,105 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:16:43,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 18:16:43,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:16:43,125 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:16:43,126 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 741 proven. 0 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-12-07 18:16:43,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:16:43,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [41] total 46 [2019-12-07 18:16:43,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897520741] [2019-12-07 18:16:43,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:16:43,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:43,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:16:43,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1820, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 18:16:43,225 INFO L87 Difference]: Start difference. First operand 1172 states and 1335 transitions. Second operand 6 states. [2019-12-07 18:16:43,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:43,347 INFO L93 Difference]: Finished difference Result 1894 states and 2155 transitions. [2019-12-07 18:16:43,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:16:43,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-12-07 18:16:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:43,350 INFO L225 Difference]: With dead ends: 1894 [2019-12-07 18:16:43,351 INFO L226 Difference]: Without dead ends: 1163 [2019-12-07 18:16:43,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=1994, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 18:16:43,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2019-12-07 18:16:43,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1090. [2019-12-07 18:16:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-12-07 18:16:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1237 transitions. [2019-12-07 18:16:43,429 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1237 transitions. Word has length 109 [2019-12-07 18:16:43,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:43,430 INFO L462 AbstractCegarLoop]: Abstraction has 1090 states and 1237 transitions. [2019-12-07 18:16:43,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:16:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1237 transitions. [2019-12-07 18:16:43,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 18:16:43,430 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:43,430 INFO L410 BasicCegarLoop]: trace histogram [30, 30, 28, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:43,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:43,631 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:43,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash 883309212, now seen corresponding path program 2 times [2019-12-07 18:16:43,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:43,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121383061] [2019-12-07 18:16:43,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 0 proven. 1371 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:16:44,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121383061] [2019-12-07 18:16:44,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553222303] [2019-12-07 18:16:44,115 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:16:44,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:16:44,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:16:44,145 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 18:16:44,146 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 4 proven. 957 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2019-12-07 18:16:44,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:16:44,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 17] total 53 [2019-12-07 18:16:44,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049198919] [2019-12-07 18:16:44,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-12-07 18:16:44,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:44,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-12-07 18:16:44,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=2296, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 18:16:44,415 INFO L87 Difference]: Start difference. First operand 1090 states and 1237 transitions. Second operand 54 states. [2019-12-07 18:16:46,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:46,441 INFO L93 Difference]: Finished difference Result 1399 states and 1589 transitions. [2019-12-07 18:16:46,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-07 18:16:46,441 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 109 [2019-12-07 18:16:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:46,445 INFO L225 Difference]: With dead ends: 1399 [2019-12-07 18:16:46,445 INFO L226 Difference]: Without dead ends: 1334 [2019-12-07 18:16:46,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2343 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2019-12-07 18:16:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-12-07 18:16:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1084. [2019-12-07 18:16:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2019-12-07 18:16:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1231 transitions. [2019-12-07 18:16:46,519 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1231 transitions. Word has length 109 [2019-12-07 18:16:46,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:46,519 INFO L462 AbstractCegarLoop]: Abstraction has 1084 states and 1231 transitions. [2019-12-07 18:16:46,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-12-07 18:16:46,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1231 transitions. [2019-12-07 18:16:46,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 18:16:46,520 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:46,520 INFO L410 BasicCegarLoop]: trace histogram [30, 30, 29, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:46,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:46,721 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:46,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:46,721 INFO L82 PathProgramCache]: Analyzing trace with hash 151341786, now seen corresponding path program 3 times [2019-12-07 18:16:46,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:46,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443255841] [2019-12-07 18:16:46,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 0 proven. 1373 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:47,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443255841] [2019-12-07 18:16:47,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904042636] [2019-12-07 18:16:47,312 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:16:47,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 18:16:47,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:16:47,333 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:16:47,334 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:47,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:47,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:47,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:16:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 711 proven. 2 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2019-12-07 18:16:47,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:16:47,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 5] total 44 [2019-12-07 18:16:47,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120804126] [2019-12-07 18:16:47,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-07 18:16:47,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:47,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-07 18:16:47,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1561, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 18:16:47,399 INFO L87 Difference]: Start difference. First operand 1084 states and 1231 transitions. Second operand 44 states. [2019-12-07 18:16:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:57,148 INFO L93 Difference]: Finished difference Result 3004 states and 3457 transitions. [2019-12-07 18:16:57,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2019-12-07 18:16:57,148 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 109 [2019-12-07 18:16:57,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:57,157 INFO L225 Difference]: With dead ends: 3004 [2019-12-07 18:16:57,157 INFO L226 Difference]: Without dead ends: 2924 [2019-12-07 18:16:57,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31325 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=15637, Invalid=64735, Unknown=0, NotChecked=0, Total=80372 [2019-12-07 18:16:57,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2019-12-07 18:16:57,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1167. [2019-12-07 18:16:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2019-12-07 18:16:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1356 transitions. [2019-12-07 18:16:57,248 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1356 transitions. Word has length 109 [2019-12-07 18:16:57,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:57,248 INFO L462 AbstractCegarLoop]: Abstraction has 1167 states and 1356 transitions. [2019-12-07 18:16:57,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-07 18:16:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1356 transitions. [2019-12-07 18:16:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 18:16:57,249 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:57,249 INFO L410 BasicCegarLoop]: trace histogram [30, 30, 30, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:57,450 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:16:57,450 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:16:57,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:57,450 INFO L82 PathProgramCache]: Analyzing trace with hash -498019554, now seen corresponding path program 1 times [2019-12-07 18:16:57,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:57,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227383725] [2019-12-07 18:16:57,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 0 proven. 1373 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:57,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227383725] [2019-12-07 18:16:57,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201177438] [2019-12-07 18:16:57,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:16:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:58,011 INFO L264 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 18:16:58,012 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:16:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 707 proven. 330 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-12-07 18:16:58,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:16:58,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 18] total 57 [2019-12-07 18:16:58,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694485035] [2019-12-07 18:16:58,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-12-07 18:16:58,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:58,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-12-07 18:16:58,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=2814, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 18:16:58,408 INFO L87 Difference]: Start difference. First operand 1167 states and 1356 transitions. Second operand 58 states. [2019-12-07 18:17:00,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:00,942 INFO L93 Difference]: Finished difference Result 2211 states and 2563 transitions. [2019-12-07 18:17:00,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-07 18:17:00,942 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 109 [2019-12-07 18:17:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:00,946 INFO L225 Difference]: With dead ends: 2211 [2019-12-07 18:17:00,946 INFO L226 Difference]: Without dead ends: 1314 [2019-12-07 18:17:00,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2288 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2172, Invalid=9818, Unknown=0, NotChecked=0, Total=11990 [2019-12-07 18:17:00,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-12-07 18:17:01,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1173. [2019-12-07 18:17:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2019-12-07 18:17:01,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1363 transitions. [2019-12-07 18:17:01,034 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1363 transitions. Word has length 109 [2019-12-07 18:17:01,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:01,034 INFO L462 AbstractCegarLoop]: Abstraction has 1173 states and 1363 transitions. [2019-12-07 18:17:01,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-12-07 18:17:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1363 transitions. [2019-12-07 18:17:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 18:17:01,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:01,035 INFO L410 BasicCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:01,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:17:01,236 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:01,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:01,236 INFO L82 PathProgramCache]: Analyzing trace with hash -340295162, now seen corresponding path program 2 times [2019-12-07 18:17:01,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:01,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614069978] [2019-12-07 18:17:01,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:01,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614069978] [2019-12-07 18:17:01,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641419144] [2019-12-07 18:17:01,771 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:17:01,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:17:01,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:17:01,798 INFO L264 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 18:17:01,800 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 802 proven. 376 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-12-07 18:17:02,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:17:02,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 19] total 60 [2019-12-07 18:17:02,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338187825] [2019-12-07 18:17:02,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-12-07 18:17:02,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:02,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-12-07 18:17:02,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=3113, Unknown=0, NotChecked=0, Total=3660 [2019-12-07 18:17:02,232 INFO L87 Difference]: Start difference. First operand 1173 states and 1363 transitions. Second operand 61 states. [2019-12-07 18:17:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:05,987 INFO L93 Difference]: Finished difference Result 2346 states and 2748 transitions. [2019-12-07 18:17:05,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-07 18:17:05,987 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 115 [2019-12-07 18:17:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:05,991 INFO L225 Difference]: With dead ends: 2346 [2019-12-07 18:17:05,991 INFO L226 Difference]: Without dead ends: 1339 [2019-12-07 18:17:05,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2558 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2417, Invalid=10923, Unknown=0, NotChecked=0, Total=13340 [2019-12-07 18:17:05,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-12-07 18:17:06,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1261. [2019-12-07 18:17:06,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1261 states. [2019-12-07 18:17:06,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1458 transitions. [2019-12-07 18:17:06,087 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1458 transitions. Word has length 115 [2019-12-07 18:17:06,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:06,087 INFO L462 AbstractCegarLoop]: Abstraction has 1261 states and 1458 transitions. [2019-12-07 18:17:06,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-12-07 18:17:06,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1458 transitions. [2019-12-07 18:17:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 18:17:06,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:06,088 INFO L410 BasicCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:17:06,289 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:17:06,289 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:06,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:06,289 INFO L82 PathProgramCache]: Analyzing trace with hash -661992994, now seen corresponding path program 3 times [2019-12-07 18:17:06,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:06,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368409131] [2019-12-07 18:17:06,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:06,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1759 backedges. 0 proven. 1759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:17:06,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368409131] [2019-12-07 18:17:06,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331588840] [2019-12-07 18:17:06,876 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:17:06,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 18:17:06,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:17:06,897 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:17:06,898 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1759 backedges. 2 proven. 907 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2019-12-07 18:17:06,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:17:06,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 5] total 48 [2019-12-07 18:17:06,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563173430] [2019-12-07 18:17:06,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-12-07 18:17:06,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:06,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-12-07 18:17:06,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=1941, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 18:17:06,986 INFO L87 Difference]: Start difference. First operand 1261 states and 1458 transitions. Second operand 49 states. [2019-12-07 18:17:35,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:35,479 INFO L93 Difference]: Finished difference Result 4116 states and 4730 transitions. [2019-12-07 18:17:35,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 336 states. [2019-12-07 18:17:35,479 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 121 [2019-12-07 18:17:35,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:35,492 INFO L225 Difference]: With dead ends: 4116 [2019-12-07 18:17:35,492 INFO L226 Difference]: Without dead ends: 4055 [2019-12-07 18:17:35,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61043 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=29831, Invalid=113431, Unknown=0, NotChecked=0, Total=143262 [2019-12-07 18:17:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4055 states. [2019-12-07 18:17:35,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4055 to 2287. [2019-12-07 18:17:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2287 states. [2019-12-07 18:17:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 2663 transitions. [2019-12-07 18:17:35,672 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 2663 transitions. Word has length 121 [2019-12-07 18:17:35,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:35,672 INFO L462 AbstractCegarLoop]: Abstraction has 2287 states and 2663 transitions. [2019-12-07 18:17:35,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-12-07 18:17:35,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2663 transitions. [2019-12-07 18:17:35,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-12-07 18:17:35,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:35,674 INFO L410 BasicCegarLoop]: trace histogram [51, 51, 48, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-12-07 18:17:35,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:17:35,875 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:35,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:35,875 INFO L82 PathProgramCache]: Analyzing trace with hash -2038057369, now seen corresponding path program 4 times [2019-12-07 18:17:35,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:35,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586824053] [2019-12-07 18:17:35,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4002 backedges. 49 proven. 3948 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 18:17:36,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586824053] [2019-12-07 18:17:36,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83298816] [2019-12-07 18:17:36,736 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/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-12-07 18:17:36,776 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 18:17:36,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:17:36,778 INFO L264 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 58 conjunts are in the unsatisfiable core [2019-12-07 18:17:36,780 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:37,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:37,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4002 backedges. 1399 proven. 2177 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-12-07 18:17:38,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:17:38,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 42] total 98 [2019-12-07 18:17:38,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432035206] [2019-12-07 18:17:38,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-12-07 18:17:38,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:38,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-12-07 18:17:38,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1029, Invalid=8477, Unknown=0, NotChecked=0, Total=9506 [2019-12-07 18:17:38,032 INFO L87 Difference]: Start difference. First operand 2287 states and 2663 transitions. Second operand 98 states. [2019-12-07 18:17:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:46,998 INFO L93 Difference]: Finished difference Result 3589 states and 4092 transitions. [2019-12-07 18:17:46,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-12-07 18:17:46,998 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 180 [2019-12-07 18:17:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:47,001 INFO L225 Difference]: With dead ends: 3589 [2019-12-07 18:17:47,001 INFO L226 Difference]: Without dead ends: 1919 [2019-12-07 18:17:47,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20549 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=7831, Invalid=61075, Unknown=0, NotChecked=0, Total=68906 [2019-12-07 18:17:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2019-12-07 18:17:47,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1418. [2019-12-07 18:17:47,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-07 18:17:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1625 transitions. [2019-12-07 18:17:47,120 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1625 transitions. Word has length 180 [2019-12-07 18:17:47,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:47,120 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 1625 transitions. [2019-12-07 18:17:47,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-12-07 18:17:47,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1625 transitions. [2019-12-07 18:17:47,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-07 18:17:47,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:47,122 INFO L410 BasicCegarLoop]: trace histogram [54, 54, 51, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-12-07 18:17:47,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:17:47,323 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:47,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:47,323 INFO L82 PathProgramCache]: Analyzing trace with hash -507321356, now seen corresponding path program 5 times [2019-12-07 18:17:47,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:47,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672945087] [2019-12-07 18:17:47,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4479 backedges. 39 proven. 4435 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 18:17:48,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672945087] [2019-12-07 18:17:48,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268823082] [2019-12-07 18:17:48,290 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:17:48,351 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2019-12-07 18:17:48,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:17:48,352 INFO L264 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 18:17:48,354 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4479 backedges. 2020 proven. 477 refuted. 0 times theorem prover too weak. 1982 trivial. 0 not checked. [2019-12-07 18:17:48,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:17:48,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 21] total 79 [2019-12-07 18:17:48,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216836799] [2019-12-07 18:17:48,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-12-07 18:17:48,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:48,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-12-07 18:17:48,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=963, Invalid=5357, Unknown=0, NotChecked=0, Total=6320 [2019-12-07 18:17:48,851 INFO L87 Difference]: Start difference. First operand 1418 states and 1625 transitions. Second operand 80 states. [2019-12-07 18:17:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:17:54,575 INFO L93 Difference]: Finished difference Result 3302 states and 3743 transitions. [2019-12-07 18:17:54,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-12-07 18:17:54,576 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 189 [2019-12-07 18:17:54,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:17:54,578 INFO L225 Difference]: With dead ends: 3302 [2019-12-07 18:17:54,578 INFO L226 Difference]: Without dead ends: 2091 [2019-12-07 18:17:54,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6387 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5500, Invalid=18680, Unknown=0, NotChecked=0, Total=24180 [2019-12-07 18:17:54,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-12-07 18:17:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1514. [2019-12-07 18:17:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1514 states. [2019-12-07 18:17:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1730 transitions. [2019-12-07 18:17:54,712 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1730 transitions. Word has length 189 [2019-12-07 18:17:54,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:17:54,712 INFO L462 AbstractCegarLoop]: Abstraction has 1514 states and 1730 transitions. [2019-12-07 18:17:54,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-12-07 18:17:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1730 transitions. [2019-12-07 18:17:54,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-12-07 18:17:54,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:17:54,714 INFO L410 BasicCegarLoop]: trace histogram [57, 57, 54, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-12-07 18:17:54,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:17:54,914 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:17:54,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:17:54,915 INFO L82 PathProgramCache]: Analyzing trace with hash -749482745, now seen corresponding path program 6 times [2019-12-07 18:17:54,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:17:54,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047544703] [2019-12-07 18:17:54,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:17:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:17:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4983 backedges. 29 proven. 4949 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 18:17:55,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047544703] [2019-12-07 18:17:55,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492143654] [2019-12-07 18:17:55,953 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:17:55,980 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-07 18:17:55,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:17:55,981 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 18:17:55,982 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:17:56,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:56,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:17:56,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4983 backedges. 2313 proven. 1 refuted. 0 times theorem prover too weak. 2669 trivial. 0 not checked. [2019-12-07 18:17:56,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:17:56,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 8] total 70 [2019-12-07 18:17:56,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813788374] [2019-12-07 18:17:56,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-12-07 18:17:56,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:17:56,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-12-07 18:17:56,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=4136, Unknown=0, NotChecked=0, Total=4830 [2019-12-07 18:17:56,175 INFO L87 Difference]: Start difference. First operand 1514 states and 1730 transitions. Second operand 70 states. [2019-12-07 18:18:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:21,413 INFO L93 Difference]: Finished difference Result 3046 states and 3308 transitions. [2019-12-07 18:18:21,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 283 states. [2019-12-07 18:18:21,414 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 198 [2019-12-07 18:18:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:21,415 INFO L225 Difference]: With dead ends: 3046 [2019-12-07 18:18:21,415 INFO L226 Difference]: Without dead ends: 624 [2019-12-07 18:18:21,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42908 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=28766, Invalid=94084, Unknown=0, NotChecked=0, Total=122850 [2019-12-07 18:18:21,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-12-07 18:18:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 295. [2019-12-07 18:18:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-12-07 18:18:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 310 transitions. [2019-12-07 18:18:21,441 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 310 transitions. Word has length 198 [2019-12-07 18:18:21,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:21,441 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 310 transitions. [2019-12-07 18:18:21,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-12-07 18:18:21,441 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 310 transitions. [2019-12-07 18:18:21,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-12-07 18:18:21,442 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:21,442 INFO L410 BasicCegarLoop]: trace histogram [57, 57, 57, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 18:18:21,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:21,642 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:18:21,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:21,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1624907463, now seen corresponding path program 4 times [2019-12-07 18:18:21,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:21,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024389430] [2019-12-07 18:18:21,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4983 backedges. 4 proven. 3915 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2019-12-07 18:18:21,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024389430] [2019-12-07 18:18:21,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781596636] [2019-12-07 18:18:21,971 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:22,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 18:18:22,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:18:22,017 INFO L264 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 18:18:22,018 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:22,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4983 backedges. 2246 proven. 532 refuted. 0 times theorem prover too weak. 2205 trivial. 0 not checked. [2019-12-07 18:18:22,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:22,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 47 [2019-12-07 18:18:22,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445389078] [2019-12-07 18:18:22,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-12-07 18:18:22,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:22,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-12-07 18:18:22,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=1757, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 18:18:22,435 INFO L87 Difference]: Start difference. First operand 295 states and 310 transitions. Second operand 48 states. [2019-12-07 18:18:25,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:25,980 INFO L93 Difference]: Finished difference Result 688 states and 730 transitions. [2019-12-07 18:18:25,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-12-07 18:18:25,980 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 198 [2019-12-07 18:18:25,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:25,981 INFO L225 Difference]: With dead ends: 688 [2019-12-07 18:18:25,981 INFO L226 Difference]: Without dead ends: 395 [2019-12-07 18:18:25,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2513 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3390, Invalid=9042, Unknown=0, NotChecked=0, Total=12432 [2019-12-07 18:18:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-12-07 18:18:26,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 313. [2019-12-07 18:18:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-12-07 18:18:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 330 transitions. [2019-12-07 18:18:26,005 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 330 transitions. Word has length 198 [2019-12-07 18:18:26,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:26,005 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 330 transitions. [2019-12-07 18:18:26,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-12-07 18:18:26,006 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 330 transitions. [2019-12-07 18:18:26,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-12-07 18:18:26,006 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:26,006 INFO L410 BasicCegarLoop]: trace histogram [60, 60, 60, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 18:18:26,207 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:26,207 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:18:26,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:26,207 INFO L82 PathProgramCache]: Analyzing trace with hash -723137398, now seen corresponding path program 5 times [2019-12-07 18:18:26,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:26,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436648079] [2019-12-07 18:18:26,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 4 proven. 3740 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-12-07 18:18:26,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436648079] [2019-12-07 18:18:26,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730954551] [2019-12-07 18:18:26,314 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:26,375 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-12-07 18:18:26,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:18:26,376 INFO L264 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 18:18:26,378 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 574 proven. 3760 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2019-12-07 18:18:26,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:26,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 28] total 33 [2019-12-07 18:18:26,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367273717] [2019-12-07 18:18:26,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 18:18:26,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:26,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 18:18:26,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=726, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 18:18:26,761 INFO L87 Difference]: Start difference. First operand 313 states and 330 transitions. Second operand 33 states. [2019-12-07 18:18:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:27,056 INFO L93 Difference]: Finished difference Result 521 states and 543 transitions. [2019-12-07 18:18:27,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 18:18:27,056 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 207 [2019-12-07 18:18:27,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:27,057 INFO L225 Difference]: With dead ends: 521 [2019-12-07 18:18:27,057 INFO L226 Difference]: Without dead ends: 449 [2019-12-07 18:18:27,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=990, Invalid=1766, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 18:18:27,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-12-07 18:18:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 381. [2019-12-07 18:18:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-12-07 18:18:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 399 transitions. [2019-12-07 18:18:27,087 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 399 transitions. Word has length 207 [2019-12-07 18:18:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:27,087 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 399 transitions. [2019-12-07 18:18:27,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 18:18:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 399 transitions. [2019-12-07 18:18:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-12-07 18:18:27,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:27,088 INFO L410 BasicCegarLoop]: trace histogram [80, 80, 80, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2019-12-07 18:18:27,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:27,289 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:18:27,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:27,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1395962766, now seen corresponding path program 6 times [2019-12-07 18:18:27,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:27,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064260834] [2019-12-07 18:18:27,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9848 backedges. 6 proven. 7482 refuted. 0 times theorem prover too weak. 2360 trivial. 0 not checked. [2019-12-07 18:18:27,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064260834] [2019-12-07 18:18:27,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141659158] [2019-12-07 18:18:27,432 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:27,544 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 62 check-sat command(s) [2019-12-07 18:18:27,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:18:27,545 INFO L264 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:18:27,547 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:27,692 INFO L134 CoverageAnalysis]: Checked inductivity of 9848 backedges. 6 proven. 7482 refuted. 0 times theorem prover too weak. 2360 trivial. 0 not checked. [2019-12-07 18:18:27,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:27,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-12-07 18:18:27,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444399251] [2019-12-07 18:18:27,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:18:27,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:27,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:18:27,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:18:27,693 INFO L87 Difference]: Start difference. First operand 381 states and 399 transitions. Second operand 13 states. [2019-12-07 18:18:27,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:27,765 INFO L93 Difference]: Finished difference Result 588 states and 611 transitions. [2019-12-07 18:18:27,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:18:27,765 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 275 [2019-12-07 18:18:27,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:27,766 INFO L225 Difference]: With dead ends: 588 [2019-12-07 18:18:27,766 INFO L226 Difference]: Without dead ends: 516 [2019-12-07 18:18:27,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:18:27,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-12-07 18:18:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 449. [2019-12-07 18:18:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-12-07 18:18:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 468 transitions. [2019-12-07 18:18:27,806 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 468 transitions. Word has length 275 [2019-12-07 18:18:27,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:27,807 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 468 transitions. [2019-12-07 18:18:27,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:18:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 468 transitions. [2019-12-07 18:18:27,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-12-07 18:18:27,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:27,808 INFO L410 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2019-12-07 18:18:28,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:28,009 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:18:28,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:28,010 INFO L82 PathProgramCache]: Analyzing trace with hash -398042990, now seen corresponding path program 7 times [2019-12-07 18:18:28,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:28,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786038944] [2019-12-07 18:18:28,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 15430 backedges. 8 proven. 12472 refuted. 0 times theorem prover too weak. 2950 trivial. 0 not checked. [2019-12-07 18:18:28,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786038944] [2019-12-07 18:18:28,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794788840] [2019-12-07 18:18:28,213 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:28,268 INFO L264 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:18:28,270 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 15430 backedges. 8 proven. 12472 refuted. 0 times theorem prover too weak. 2950 trivial. 0 not checked. [2019-12-07 18:18:28,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:28,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-12-07 18:18:28,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574667354] [2019-12-07 18:18:28,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:18:28,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:28,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:18:28,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:18:28,508 INFO L87 Difference]: Start difference. First operand 449 states and 468 transitions. Second operand 15 states. [2019-12-07 18:18:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:28,609 INFO L93 Difference]: Finished difference Result 656 states and 680 transitions. [2019-12-07 18:18:28,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:18:28,609 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 343 [2019-12-07 18:18:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:28,610 INFO L225 Difference]: With dead ends: 656 [2019-12-07 18:18:28,610 INFO L226 Difference]: Without dead ends: 584 [2019-12-07 18:18:28,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:18:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-12-07 18:18:28,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 517. [2019-12-07 18:18:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-12-07 18:18:28,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 537 transitions. [2019-12-07 18:18:28,653 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 537 transitions. Word has length 343 [2019-12-07 18:18:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:28,653 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 537 transitions. [2019-12-07 18:18:28,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:18:28,653 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 537 transitions. [2019-12-07 18:18:28,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-12-07 18:18:28,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:28,655 INFO L410 BasicCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1] [2019-12-07 18:18:28,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:28,855 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:18:28,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:28,856 INFO L82 PathProgramCache]: Analyzing trace with hash -610550890, now seen corresponding path program 8 times [2019-12-07 18:18:28,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:28,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738524365] [2019-12-07 18:18:28,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 10 proven. 18710 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2019-12-07 18:18:29,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738524365] [2019-12-07 18:18:29,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858268396] [2019-12-07 18:18:29,145 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:29,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:18:29,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:18:29,208 INFO L264 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:18:29,211 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 10 proven. 18710 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2019-12-07 18:18:29,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:29,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-12-07 18:18:29,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174746177] [2019-12-07 18:18:29,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 18:18:29,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:29,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 18:18:29,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:18:29,516 INFO L87 Difference]: Start difference. First operand 517 states and 537 transitions. Second operand 17 states. [2019-12-07 18:18:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:29,611 INFO L93 Difference]: Finished difference Result 724 states and 749 transitions. [2019-12-07 18:18:29,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:18:29,611 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 411 [2019-12-07 18:18:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:29,613 INFO L225 Difference]: With dead ends: 724 [2019-12-07 18:18:29,613 INFO L226 Difference]: Without dead ends: 652 [2019-12-07 18:18:29,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:18:29,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-12-07 18:18:29,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 585. [2019-12-07 18:18:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-12-07 18:18:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 606 transitions. [2019-12-07 18:18:29,660 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 606 transitions. Word has length 411 [2019-12-07 18:18:29,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:29,661 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 606 transitions. [2019-12-07 18:18:29,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 18:18:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 606 transitions. [2019-12-07 18:18:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-12-07 18:18:29,662 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:29,663 INFO L410 BasicCegarLoop]: trace histogram [140, 140, 140, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1] [2019-12-07 18:18:29,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:29,863 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:18:29,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:29,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1144380570, now seen corresponding path program 9 times [2019-12-07 18:18:29,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:29,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175164789] [2019-12-07 18:18:29,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 30338 backedges. 12 proven. 26196 refuted. 0 times theorem prover too weak. 4130 trivial. 0 not checked. [2019-12-07 18:18:30,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175164789] [2019-12-07 18:18:30,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16178949] [2019-12-07 18:18:30,225 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:30,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-12-07 18:18:30,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:18:30,357 INFO L264 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:18:30,360 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 30338 backedges. 12 proven. 26196 refuted. 0 times theorem prover too weak. 4130 trivial. 0 not checked. [2019-12-07 18:18:30,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:30,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-12-07 18:18:30,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301048632] [2019-12-07 18:18:30,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 18:18:30,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:30,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 18:18:30,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:18:30,776 INFO L87 Difference]: Start difference. First operand 585 states and 606 transitions. Second operand 19 states. [2019-12-07 18:18:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:30,885 INFO L93 Difference]: Finished difference Result 792 states and 818 transitions. [2019-12-07 18:18:30,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:18:30,886 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 479 [2019-12-07 18:18:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:30,886 INFO L225 Difference]: With dead ends: 792 [2019-12-07 18:18:30,886 INFO L226 Difference]: Without dead ends: 720 [2019-12-07 18:18:30,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:18:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-12-07 18:18:30,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 653. [2019-12-07 18:18:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-12-07 18:18:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 675 transitions. [2019-12-07 18:18:30,939 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 675 transitions. Word has length 479 [2019-12-07 18:18:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:30,939 INFO L462 AbstractCegarLoop]: Abstraction has 653 states and 675 transitions. [2019-12-07 18:18:30,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 18:18:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 675 transitions. [2019-12-07 18:18:30,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2019-12-07 18:18:30,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:30,943 INFO L410 BasicCegarLoop]: trace histogram [160, 160, 160, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1] [2019-12-07 18:18:31,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:31,144 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:18:31,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:31,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1217772446, now seen corresponding path program 10 times [2019-12-07 18:18:31,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:31,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993825676] [2019-12-07 18:18:31,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 39664 backedges. 14 proven. 34930 refuted. 0 times theorem prover too weak. 4720 trivial. 0 not checked. [2019-12-07 18:18:31,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993825676] [2019-12-07 18:18:31,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617186911] [2019-12-07 18:18:31,605 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:31,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 18:18:31,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:18:31,691 INFO L264 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 18:18:31,694 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 39664 backedges. 584 proven. 34950 refuted. 0 times theorem prover too weak. 4130 trivial. 0 not checked. [2019-12-07 18:18:32,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:32,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 33] total 43 [2019-12-07 18:18:32,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303846679] [2019-12-07 18:18:32,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 18:18:32,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:32,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 18:18:32,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=1346, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 18:18:32,574 INFO L87 Difference]: Start difference. First operand 653 states and 675 transitions. Second operand 43 states. [2019-12-07 18:18:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:32,926 INFO L93 Difference]: Finished difference Result 861 states and 888 transitions. [2019-12-07 18:18:32,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 18:18:32,926 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 547 [2019-12-07 18:18:32,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:32,927 INFO L225 Difference]: With dead ends: 861 [2019-12-07 18:18:32,927 INFO L226 Difference]: Without dead ends: 789 [2019-12-07 18:18:32,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1320, Invalid=2586, Unknown=0, NotChecked=0, Total=3906 [2019-12-07 18:18:32,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-12-07 18:18:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 721. [2019-12-07 18:18:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-12-07 18:18:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 744 transitions. [2019-12-07 18:18:32,993 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 744 transitions. Word has length 547 [2019-12-07 18:18:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:32,993 INFO L462 AbstractCegarLoop]: Abstraction has 721 states and 744 transitions. [2019-12-07 18:18:32,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 18:18:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 744 transitions. [2019-12-07 18:18:32,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2019-12-07 18:18:32,997 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:32,997 INFO L410 BasicCegarLoop]: trace histogram [180, 180, 180, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1] [2019-12-07 18:18:33,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:33,198 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:18:33,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:33,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1589401762, now seen corresponding path program 11 times [2019-12-07 18:18:33,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:33,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387211217] [2019-12-07 18:18:33,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:33,758 INFO L134 CoverageAnalysis]: Checked inductivity of 50238 backedges. 16 proven. 44912 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2019-12-07 18:18:33,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387211217] [2019-12-07 18:18:33,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497350456] [2019-12-07 18:18:33,758 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:34,095 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 88 check-sat command(s) [2019-12-07 18:18:34,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:18:34,098 INFO L264 TraceCheckSpWp]: Trace formula consists of 946 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 18:18:34,103 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 50238 backedges. 586 proven. 44932 refuted. 0 times theorem prover too weak. 4720 trivial. 0 not checked. [2019-12-07 18:18:35,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:35,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 34] total 45 [2019-12-07 18:18:35,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407859391] [2019-12-07 18:18:35,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-12-07 18:18:35,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:35,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-12-07 18:18:35,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=1506, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 18:18:35,088 INFO L87 Difference]: Start difference. First operand 721 states and 744 transitions. Second operand 45 states. [2019-12-07 18:18:35,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:35,806 INFO L93 Difference]: Finished difference Result 929 states and 957 transitions. [2019-12-07 18:18:35,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-07 18:18:35,807 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 615 [2019-12-07 18:18:35,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:35,808 INFO L225 Difference]: With dead ends: 929 [2019-12-07 18:18:35,808 INFO L226 Difference]: Without dead ends: 857 [2019-12-07 18:18:35,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1615 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2509, Invalid=4801, Unknown=0, NotChecked=0, Total=7310 [2019-12-07 18:18:35,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-12-07 18:18:35,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 789. [2019-12-07 18:18:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-07 18:18:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 813 transitions. [2019-12-07 18:18:35,878 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 813 transitions. Word has length 615 [2019-12-07 18:18:35,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:35,879 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 813 transitions. [2019-12-07 18:18:35,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-12-07 18:18:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 813 transitions. [2019-12-07 18:18:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-12-07 18:18:35,882 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:35,882 INFO L410 BasicCegarLoop]: trace histogram [200, 200, 200, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1] [2019-12-07 18:18:36,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:36,083 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:18:36,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:36,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1943358554, now seen corresponding path program 12 times [2019-12-07 18:18:36,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:36,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763827224] [2019-12-07 18:18:36,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 62060 backedges. 18 proven. 56142 refuted. 0 times theorem prover too weak. 5900 trivial. 0 not checked. [2019-12-07 18:18:36,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763827224] [2019-12-07 18:18:36,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566059284] [2019-12-07 18:18:36,775 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:36,985 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 65 check-sat command(s) [2019-12-07 18:18:36,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:18:36,988 INFO L264 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 18:18:36,991 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 62060 backedges. 18 proven. 56142 refuted. 0 times theorem prover too weak. 5900 trivial. 0 not checked. [2019-12-07 18:18:37,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:37,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-12-07 18:18:37,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189702237] [2019-12-07 18:18:37,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 18:18:37,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:37,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 18:18:37,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:18:37,773 INFO L87 Difference]: Start difference. First operand 789 states and 813 transitions. Second operand 25 states. [2019-12-07 18:18:37,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:37,907 INFO L93 Difference]: Finished difference Result 996 states and 1025 transitions. [2019-12-07 18:18:37,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:18:37,908 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 683 [2019-12-07 18:18:37,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:37,909 INFO L225 Difference]: With dead ends: 996 [2019-12-07 18:18:37,909 INFO L226 Difference]: Without dead ends: 924 [2019-12-07 18:18:37,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 672 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:18:37,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-12-07 18:18:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 857. [2019-12-07 18:18:37,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-12-07 18:18:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 882 transitions. [2019-12-07 18:18:37,984 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 882 transitions. Word has length 683 [2019-12-07 18:18:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:37,985 INFO L462 AbstractCegarLoop]: Abstraction has 857 states and 882 transitions. [2019-12-07 18:18:37,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 18:18:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 882 transitions. [2019-12-07 18:18:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2019-12-07 18:18:37,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:37,989 INFO L410 BasicCegarLoop]: trace histogram [220, 220, 220, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1] [2019-12-07 18:18:38,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:38,189 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:18:38,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:38,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1511928662, now seen corresponding path program 13 times [2019-12-07 18:18:38,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:38,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190625855] [2019-12-07 18:18:38,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:39,025 INFO L134 CoverageAnalysis]: Checked inductivity of 75130 backedges. 20 proven. 68620 refuted. 0 times theorem prover too weak. 6490 trivial. 0 not checked. [2019-12-07 18:18:39,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190625855] [2019-12-07 18:18:39,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077855531] [2019-12-07 18:18:39,026 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:39,127 INFO L264 TraceCheckSpWp]: Trace formula consists of 1150 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 18:18:39,131 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 75130 backedges. 20 proven. 68620 refuted. 0 times theorem prover too weak. 6490 trivial. 0 not checked. [2019-12-07 18:18:40,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:40,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-12-07 18:18:40,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004416797] [2019-12-07 18:18:40,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 18:18:40,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:40,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 18:18:40,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:18:40,079 INFO L87 Difference]: Start difference. First operand 857 states and 882 transitions. Second operand 27 states. [2019-12-07 18:18:40,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:40,254 INFO L93 Difference]: Finished difference Result 1064 states and 1094 transitions. [2019-12-07 18:18:40,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:18:40,255 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 751 [2019-12-07 18:18:40,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:40,256 INFO L225 Difference]: With dead ends: 1064 [2019-12-07 18:18:40,256 INFO L226 Difference]: Without dead ends: 992 [2019-12-07 18:18:40,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 739 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:18:40,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-12-07 18:18:40,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 925. [2019-12-07 18:18:40,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2019-12-07 18:18:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 951 transitions. [2019-12-07 18:18:40,337 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 951 transitions. Word has length 751 [2019-12-07 18:18:40,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:40,338 INFO L462 AbstractCegarLoop]: Abstraction has 925 states and 951 transitions. [2019-12-07 18:18:40,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 18:18:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 951 transitions. [2019-12-07 18:18:40,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2019-12-07 18:18:40,342 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:40,343 INFO L410 BasicCegarLoop]: trace histogram [240, 240, 240, 12, 12, 12, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1] [2019-12-07 18:18:40,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:40,543 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:18:40,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:40,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1872583762, now seen corresponding path program 14 times [2019-12-07 18:18:40,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:40,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364019530] [2019-12-07 18:18:40,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:41,514 INFO L134 CoverageAnalysis]: Checked inductivity of 89448 backedges. 22 proven. 82346 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-12-07 18:18:41,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364019530] [2019-12-07 18:18:41,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316827165] [2019-12-07 18:18:41,514 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:41,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:18:41,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:18:41,636 INFO L264 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 18:18:41,641 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 89448 backedges. 22 proven. 82346 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-12-07 18:18:42,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:42,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2019-12-07 18:18:42,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174907495] [2019-12-07 18:18:42,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 18:18:42,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:42,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 18:18:42,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2019-12-07 18:18:42,754 INFO L87 Difference]: Start difference. First operand 925 states and 951 transitions. Second operand 29 states. [2019-12-07 18:18:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:42,914 INFO L93 Difference]: Finished difference Result 1132 states and 1163 transitions. [2019-12-07 18:18:42,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:18:42,914 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 819 [2019-12-07 18:18:42,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:42,915 INFO L225 Difference]: With dead ends: 1132 [2019-12-07 18:18:42,915 INFO L226 Difference]: Without dead ends: 1060 [2019-12-07 18:18:42,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 806 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2019-12-07 18:18:42,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-12-07 18:18:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 993. [2019-12-07 18:18:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-12-07 18:18:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1020 transitions. [2019-12-07 18:18:43,000 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1020 transitions. Word has length 819 [2019-12-07 18:18:43,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:43,000 INFO L462 AbstractCegarLoop]: Abstraction has 993 states and 1020 transitions. [2019-12-07 18:18:43,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 18:18:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1020 transitions. [2019-12-07 18:18:43,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2019-12-07 18:18:43,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:43,005 INFO L410 BasicCegarLoop]: trace histogram [260, 260, 260, 13, 13, 13, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1] [2019-12-07 18:18:43,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:43,206 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:18:43,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:43,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2142124210, now seen corresponding path program 15 times [2019-12-07 18:18:43,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:43,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012408120] [2019-12-07 18:18:43,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:44,323 INFO L134 CoverageAnalysis]: Checked inductivity of 105014 backedges. 24 proven. 97320 refuted. 0 times theorem prover too weak. 7670 trivial. 0 not checked. [2019-12-07 18:18:44,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012408120] [2019-12-07 18:18:44,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144413201] [2019-12-07 18:18:44,323 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:44,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 131 check-sat command(s) [2019-12-07 18:18:44,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:18:44,794 INFO L264 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 18:18:44,798 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 105014 backedges. 24 proven. 97320 refuted. 0 times theorem prover too weak. 7670 trivial. 0 not checked. [2019-12-07 18:18:46,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:46,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-12-07 18:18:46,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751522298] [2019-12-07 18:18:46,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 18:18:46,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:46,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 18:18:46,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-12-07 18:18:46,084 INFO L87 Difference]: Start difference. First operand 993 states and 1020 transitions. Second operand 31 states. [2019-12-07 18:18:46,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:46,273 INFO L93 Difference]: Finished difference Result 1200 states and 1232 transitions. [2019-12-07 18:18:46,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 18:18:46,273 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 887 [2019-12-07 18:18:46,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:46,274 INFO L225 Difference]: With dead ends: 1200 [2019-12-07 18:18:46,274 INFO L226 Difference]: Without dead ends: 1128 [2019-12-07 18:18:46,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-12-07 18:18:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-12-07 18:18:46,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1061. [2019-12-07 18:18:46,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2019-12-07 18:18:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1089 transitions. [2019-12-07 18:18:46,365 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1089 transitions. Word has length 887 [2019-12-07 18:18:46,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:46,366 INFO L462 AbstractCegarLoop]: Abstraction has 1061 states and 1089 transitions. [2019-12-07 18:18:46,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 18:18:46,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1089 transitions. [2019-12-07 18:18:46,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2019-12-07 18:18:46,371 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:46,371 INFO L410 BasicCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 13, 13, 1, 1, 1, 1, 1] [2019-12-07 18:18:46,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:46,572 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:18:46,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:46,572 INFO L82 PathProgramCache]: Analyzing trace with hash 927304630, now seen corresponding path program 16 times [2019-12-07 18:18:46,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:46,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919155873] [2019-12-07 18:18:46,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 121828 backedges. 26 proven. 113542 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2019-12-07 18:18:47,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919155873] [2019-12-07 18:18:47,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506904040] [2019-12-07 18:18:47,829 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:47,965 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 18:18:47,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:18:47,969 INFO L264 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 18:18:47,975 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 121828 backedges. 596 proven. 113562 refuted. 0 times theorem prover too weak. 7670 trivial. 0 not checked. [2019-12-07 18:18:49,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:49,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 39] total 55 [2019-12-07 18:18:49,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828073779] [2019-12-07 18:18:49,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-12-07 18:18:49,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:49,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-12-07 18:18:49,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=2255, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 18:18:49,889 INFO L87 Difference]: Start difference. First operand 1061 states and 1089 transitions. Second operand 55 states. [2019-12-07 18:18:50,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:50,346 INFO L93 Difference]: Finished difference Result 1269 states and 1302 transitions. [2019-12-07 18:18:50,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 18:18:50,347 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 955 [2019-12-07 18:18:50,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:50,348 INFO L225 Difference]: With dead ends: 1269 [2019-12-07 18:18:50,348 INFO L226 Difference]: Without dead ends: 1197 [2019-12-07 18:18:50,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 991 GetRequests, 918 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1815, Invalid=3735, Unknown=0, NotChecked=0, Total=5550 [2019-12-07 18:18:50,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-12-07 18:18:50,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1129. [2019-12-07 18:18:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2019-12-07 18:18:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1158 transitions. [2019-12-07 18:18:50,450 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1158 transitions. Word has length 955 [2019-12-07 18:18:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:50,451 INFO L462 AbstractCegarLoop]: Abstraction has 1129 states and 1158 transitions. [2019-12-07 18:18:50,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-12-07 18:18:50,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1158 transitions. [2019-12-07 18:18:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1024 [2019-12-07 18:18:50,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:50,457 INFO L410 BasicCegarLoop]: trace histogram [300, 300, 300, 15, 15, 15, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1] [2019-12-07 18:18:50,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:50,657 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:18:50,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:50,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1244241082, now seen corresponding path program 17 times [2019-12-07 18:18:50,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:50,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820073441] [2019-12-07 18:18:50,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:52,116 INFO L134 CoverageAnalysis]: Checked inductivity of 139890 backedges. 28 proven. 131012 refuted. 0 times theorem prover too weak. 8850 trivial. 0 not checked. [2019-12-07 18:18:52,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820073441] [2019-12-07 18:18:52,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079710355] [2019-12-07 18:18:52,117 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:52,855 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 153 check-sat command(s) [2019-12-07 18:18:52,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:18:52,859 INFO L264 TraceCheckSpWp]: Trace formula consists of 1558 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 18:18:52,864 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:18:54,907 INFO L134 CoverageAnalysis]: Checked inductivity of 139890 backedges. 598 proven. 131032 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2019-12-07 18:18:54,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:18:54,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 40] total 57 [2019-12-07 18:18:54,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137079170] [2019-12-07 18:18:54,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-12-07 18:18:54,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:18:54,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-12-07 18:18:54,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=2487, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 18:18:54,909 INFO L87 Difference]: Start difference. First operand 1129 states and 1158 transitions. Second operand 57 states. [2019-12-07 18:18:56,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:18:56,017 INFO L93 Difference]: Finished difference Result 1337 states and 1371 transitions. [2019-12-07 18:18:56,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-12-07 18:18:56,017 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 1023 [2019-12-07 18:18:56,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:18:56,019 INFO L225 Difference]: With dead ends: 1337 [2019-12-07 18:18:56,019 INFO L226 Difference]: Without dead ends: 1265 [2019-12-07 18:18:56,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1102 GetRequests, 985 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3647 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4808, Invalid=9234, Unknown=0, NotChecked=0, Total=14042 [2019-12-07 18:18:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-12-07 18:18:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1197. [2019-12-07 18:18:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-12-07 18:18:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1227 transitions. [2019-12-07 18:18:56,126 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1227 transitions. Word has length 1023 [2019-12-07 18:18:56,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:18:56,126 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1227 transitions. [2019-12-07 18:18:56,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-12-07 18:18:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1227 transitions. [2019-12-07 18:18:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1092 [2019-12-07 18:18:56,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:18:56,133 INFO L410 BasicCegarLoop]: trace histogram [320, 320, 320, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1] [2019-12-07 18:18:56,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:56,334 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:18:56,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:18:56,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1524329406, now seen corresponding path program 18 times [2019-12-07 18:18:56,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:18:56,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386024799] [2019-12-07 18:18:56,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:18:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:18:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 159200 backedges. 30 proven. 149730 refuted. 0 times theorem prover too weak. 9440 trivial. 0 not checked. [2019-12-07 18:18:57,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386024799] [2019-12-07 18:18:57,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852991023] [2019-12-07 18:18:57,987 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:18:58,417 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 139 check-sat command(s) [2019-12-07 18:18:58,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:18:58,420 INFO L264 TraceCheckSpWp]: Trace formula consists of 1244 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 18:18:58,426 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:19:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 159200 backedges. 30 proven. 149730 refuted. 0 times theorem prover too weak. 9440 trivial. 0 not checked. [2019-12-07 18:19:00,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:19:00,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-12-07 18:19:00,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546635684] [2019-12-07 18:19:00,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 18:19:00,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:19:00,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 18:19:00,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 18:19:00,353 INFO L87 Difference]: Start difference. First operand 1197 states and 1227 transitions. Second operand 37 states. [2019-12-07 18:19:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:19:00,599 INFO L93 Difference]: Finished difference Result 1404 states and 1439 transitions. [2019-12-07 18:19:00,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 18:19:00,600 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1091 [2019-12-07 18:19:00,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:19:00,601 INFO L225 Difference]: With dead ends: 1404 [2019-12-07 18:19:00,601 INFO L226 Difference]: Without dead ends: 1332 [2019-12-07 18:19:00,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1109 GetRequests, 1074 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 18:19:00,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2019-12-07 18:19:00,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1265. [2019-12-07 18:19:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-12-07 18:19:00,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1296 transitions. [2019-12-07 18:19:00,718 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1296 transitions. Word has length 1091 [2019-12-07 18:19:00,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:19:00,718 INFO L462 AbstractCegarLoop]: Abstraction has 1265 states and 1296 transitions. [2019-12-07 18:19:00,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 18:19:00,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1296 transitions. [2019-12-07 18:19:00,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1160 [2019-12-07 18:19:00,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:19:00,726 INFO L410 BasicCegarLoop]: trace histogram [340, 340, 340, 17, 17, 17, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1] [2019-12-07 18:19:00,926 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:19:00,926 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:19:00,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:19:00,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1532754114, now seen corresponding path program 19 times [2019-12-07 18:19:00,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:19:00,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662040707] [2019-12-07 18:19:00,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:19:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:19:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 179758 backedges. 32 proven. 169696 refuted. 0 times theorem prover too weak. 10030 trivial. 0 not checked. [2019-12-07 18:19:02,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662040707] [2019-12-07 18:19:02,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605862772] [2019-12-07 18:19:02,793 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:19:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:19:02,942 INFO L264 TraceCheckSpWp]: Trace formula consists of 1762 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 18:19:02,948 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:19:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 179758 backedges. 32 proven. 169696 refuted. 0 times theorem prover too weak. 10030 trivial. 0 not checked. [2019-12-07 18:19:05,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:19:05,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2019-12-07 18:19:05,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237708761] [2019-12-07 18:19:05,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-07 18:19:05,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:19:05,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-07 18:19:05,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 18:19:05,107 INFO L87 Difference]: Start difference. First operand 1265 states and 1296 transitions. Second operand 39 states. [2019-12-07 18:19:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:19:05,345 INFO L93 Difference]: Finished difference Result 1472 states and 1508 transitions. [2019-12-07 18:19:05,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 18:19:05,346 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1159 [2019-12-07 18:19:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:19:05,347 INFO L225 Difference]: With dead ends: 1472 [2019-12-07 18:19:05,347 INFO L226 Difference]: Without dead ends: 1400 [2019-12-07 18:19:05,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1178 GetRequests, 1141 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 18:19:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2019-12-07 18:19:05,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1333. [2019-12-07 18:19:05,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-12-07 18:19:05,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1365 transitions. [2019-12-07 18:19:05,469 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1365 transitions. Word has length 1159 [2019-12-07 18:19:05,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:19:05,469 INFO L462 AbstractCegarLoop]: Abstraction has 1333 states and 1365 transitions. [2019-12-07 18:19:05,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-07 18:19:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1365 transitions. [2019-12-07 18:19:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1228 [2019-12-07 18:19:05,477 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:19:05,478 INFO L410 BasicCegarLoop]: trace histogram [360, 360, 360, 18, 18, 18, 18, 18, 18, 17, 17, 1, 1, 1, 1, 1] [2019-12-07 18:19:05,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:19:05,678 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:19:05,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:19:05,679 INFO L82 PathProgramCache]: Analyzing trace with hash -852737082, now seen corresponding path program 20 times [2019-12-07 18:19:05,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:19:05,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037884066] [2019-12-07 18:19:05,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:19:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:19:07,753 INFO L134 CoverageAnalysis]: Checked inductivity of 201564 backedges. 34 proven. 190910 refuted. 0 times theorem prover too weak. 10620 trivial. 0 not checked. [2019-12-07 18:19:07,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037884066] [2019-12-07 18:19:07,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193624058] [2019-12-07 18:19:07,754 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:19:07,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:19:07,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:19:07,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 1864 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 18:19:07,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:19:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 201564 backedges. 34 proven. 190910 refuted. 0 times theorem prover too weak. 10620 trivial. 0 not checked. [2019-12-07 18:19:10,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:19:10,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2019-12-07 18:19:10,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550469993] [2019-12-07 18:19:10,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 18:19:10,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:19:10,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 18:19:10,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 18:19:10,330 INFO L87 Difference]: Start difference. First operand 1333 states and 1365 transitions. Second operand 41 states. [2019-12-07 18:19:10,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:19:10,570 INFO L93 Difference]: Finished difference Result 1540 states and 1577 transitions. [2019-12-07 18:19:10,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:19:10,570 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1227 [2019-12-07 18:19:10,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:19:10,571 INFO L225 Difference]: With dead ends: 1540 [2019-12-07 18:19:10,571 INFO L226 Difference]: Without dead ends: 1468 [2019-12-07 18:19:10,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1247 GetRequests, 1208 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 18:19:10,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2019-12-07 18:19:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1401. [2019-12-07 18:19:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-12-07 18:19:10,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1434 transitions. [2019-12-07 18:19:10,701 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1434 transitions. Word has length 1227 [2019-12-07 18:19:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:19:10,701 INFO L462 AbstractCegarLoop]: Abstraction has 1401 states and 1434 transitions. [2019-12-07 18:19:10,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 18:19:10,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1434 transitions. [2019-12-07 18:19:10,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1296 [2019-12-07 18:19:10,710 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:19:10,711 INFO L410 BasicCegarLoop]: trace histogram [380, 380, 380, 19, 19, 19, 19, 19, 19, 18, 18, 1, 1, 1, 1, 1] [2019-12-07 18:19:10,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:19:10,911 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:19:10,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:19:10,911 INFO L82 PathProgramCache]: Analyzing trace with hash 21843146, now seen corresponding path program 21 times [2019-12-07 18:19:10,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:19:10,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985917704] [2019-12-07 18:19:10,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:19:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:19:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 224618 backedges. 36 proven. 213372 refuted. 0 times theorem prover too weak. 11210 trivial. 0 not checked. [2019-12-07 18:19:13,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985917704] [2019-12-07 18:19:13,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414346445] [2019-12-07 18:19:13,197 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:19:13,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 137 check-sat command(s) [2019-12-07 18:19:13,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:19:13,729 INFO L264 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 18:19:13,736 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:19:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 224618 backedges. 36 proven. 213372 refuted. 0 times theorem prover too weak. 11210 trivial. 0 not checked. [2019-12-07 18:19:16,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:19:16,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2019-12-07 18:19:16,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019198377] [2019-12-07 18:19:16,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 18:19:16,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:19:16,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 18:19:16,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 18:19:16,422 INFO L87 Difference]: Start difference. First operand 1401 states and 1434 transitions. Second operand 43 states. [2019-12-07 18:19:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:19:16,686 INFO L93 Difference]: Finished difference Result 1608 states and 1646 transitions. [2019-12-07 18:19:16,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 18:19:16,686 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 1295 [2019-12-07 18:19:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:19:16,687 INFO L225 Difference]: With dead ends: 1608 [2019-12-07 18:19:16,687 INFO L226 Difference]: Without dead ends: 1536 [2019-12-07 18:19:16,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1316 GetRequests, 1275 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 18:19:16,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2019-12-07 18:19:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1469. [2019-12-07 18:19:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2019-12-07 18:19:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 1503 transitions. [2019-12-07 18:19:16,826 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 1503 transitions. Word has length 1295 [2019-12-07 18:19:16,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:19:16,826 INFO L462 AbstractCegarLoop]: Abstraction has 1469 states and 1503 transitions. [2019-12-07 18:19:16,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 18:19:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1503 transitions. [2019-12-07 18:19:16,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1364 [2019-12-07 18:19:16,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:19:16,836 INFO L410 BasicCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1] [2019-12-07 18:19:17,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:19:17,037 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:19:17,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:19:17,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1480594382, now seen corresponding path program 22 times [2019-12-07 18:19:17,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:19:17,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894996329] [2019-12-07 18:19:17,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:19:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:19:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:19:17,565 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:19:17,566 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:19:17,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:19:17 BoogieIcfgContainer [2019-12-07 18:19:17,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:19:17,774 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:19:17,774 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:19:17,774 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:19:17,775 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:15:20" (3/4) ... [2019-12-07 18:19:17,776 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:19:17,961 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_be2a652b-81bd-4037-81d0-88dcd54b73bf/bin/uautomizer/witness.graphml [2019-12-07 18:19:17,961 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:19:17,963 INFO L168 Benchmark]: Toolchain (without parser) took 237649.97 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 609.2 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 427.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:19:17,963 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:19:17,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:19:17,963 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:19:17,963 INFO L168 Benchmark]: Boogie Preprocessor took 15.31 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:19:17,964 INFO L168 Benchmark]: RCFGBuilder took 162.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:19:17,964 INFO L168 Benchmark]: TraceAbstraction took 237063.55 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 493.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -85.1 MB). Peak memory consumption was 408.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:19:17,964 INFO L168 Benchmark]: Witness Printer took 187.10 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:19:17,965 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 195.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.31 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 162.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 237063.55 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 493.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -85.1 MB). Peak memory consumption was 408.3 MB. Max. memory is 11.5 GB. * Witness Printer took 187.10 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L4] int last ; [L13] int SIZE = 20; VAL [last=0, SIZE=20] [L15] last = __VERIFIER_nondet_int() [L17] int a=0,b=0,c=0,st=0,d=0; VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND FALSE !(d == SIZE) VAL [last=21, SIZE=20] [L6] COND FALSE !(!(cond)) VAL [last=21, SIZE=20] [L18] COND TRUE 1 [L19] st=1 [L20] c=0 VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND TRUE c=last) VAL [last=21, SIZE=20] [L20] c++ VAL [last=21, SIZE=20] [L20] COND FALSE !(c=SIZE [L30] d++ VAL [last=21, SIZE=20] [L32] COND TRUE d == SIZE [L33] a = 0 [L34] b = 1 VAL [last=21, SIZE=20] [L6] COND TRUE !(cond) VAL [last=21, SIZE=20] [L7] __VERIFIER_error() VAL [last=21, SIZE=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Result: UNSAFE, OverallTime: 236.8s, OverallIterations: 60, TraceHistogramMax: 400, AutomataDifference: 161.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 738 SDtfs, 26081 SDslu, 6085 SDs, 0 SdLazy, 40465 SolverSat, 6902 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19948 GetRequests, 15052 SyntacticMatches, 1 SemanticMatches, 4895 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319645 ImplicationChecksByTransitivity, 149.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2287occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 59 MinimizatonAttempts, 15077 StatesRemovedByMinimization, 59 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 5.4s SatisfiabilityAnalysisTime, 40.7s InterpolantComputationTime, 32789 NumberOfCodeBlocks, 31214 NumberOfCodeBlocksAsserted, 1072 NumberOfCheckSat, 31314 ConstructedInterpolants, 0 QuantifiedInterpolants, 139860144 SizeOfPredicates, 174 NumberOfNonLiveVariables, 23025 ConjunctsInSsa, 865 ConjunctsInUnsatCore, 112 InterpolantComputations, 11 PerfectInterpolantSequences, 252581/3139181 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 incorrect! Received shutdown request...