./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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.24-cad4683 [2019-11-15 22:12:10,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:12:10,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:12:10,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:12:10,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:12:10,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:12:10,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:12:10,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:12:10,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:12:10,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:12:10,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:12:10,313 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:12:10,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:12:10,314 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:12:10,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:12:10,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:12:10,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:12:10,318 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:12:10,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:12:10,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:12:10,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:12:10,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:12:10,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:12:10,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:12:10,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:12:10,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:12:10,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:12:10,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:12:10,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:12:10,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:12:10,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:12:10,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:12:10,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:12:10,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:12:10,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:12:10,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:12:10,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:12:10,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:12:10,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:12:10,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:12:10,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:12:10,341 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:12:10,356 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:12:10,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:12:10,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:12:10,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:12:10,357 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:12:10,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:12:10,358 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:12:10,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:12:10,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:12:10,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:12:10,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:12:10,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:12:10,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:12:10,360 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:12:10,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:12:10,360 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:12:10,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:12:10,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:12:10,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:12:10,361 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:12:10,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:12:10,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:12:10,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:12:10,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:12:10,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:12:10,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:12:10,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:12:10,363 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:12:10,364 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_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:12:10,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:12:10,400 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:12:10,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:12:10,405 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:12:10,405 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:12:10,406 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/../../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2019-11-15 22:12:10,462 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/data/e6191afc8/8da70738b39e4da994fd11f07e90d919/FLAG826189b17 [2019-11-15 22:12:10,884 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:12:10,886 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2019-11-15 22:12:10,892 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/data/e6191afc8/8da70738b39e4da994fd11f07e90d919/FLAG826189b17 [2019-11-15 22:12:10,909 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/data/e6191afc8/8da70738b39e4da994fd11f07e90d919 [2019-11-15 22:12:10,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:12:10,914 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:12:10,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:12:10,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:12:10,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:12:10,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:12:10" (1/1) ... [2019-11-15 22:12:10,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43aca58f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:12:10, skipping insertion in model container [2019-11-15 22:12:10,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:12:10" (1/1) ... [2019-11-15 22:12:10,927 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:12:10,945 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:12:11,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:12:11,197 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:12:11,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:12:11,221 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:12:11,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:12:11 WrapperNode [2019-11-15 22:12:11,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:12:11,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:12:11,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:12:11,223 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:12:11,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:12:11" (1/1) ... [2019-11-15 22:12:11,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:12:11" (1/1) ... [2019-11-15 22:12:11,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:12:11,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:12:11,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:12:11,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:12:11,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:12:11" (1/1) ... [2019-11-15 22:12:11,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:12:11" (1/1) ... [2019-11-15 22:12:11,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:12:11" (1/1) ... [2019-11-15 22:12:11,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:12:11" (1/1) ... [2019-11-15 22:12:11,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:12:11" (1/1) ... [2019-11-15 22:12:11,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:12:11" (1/1) ... [2019-11-15 22:12:11,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:12:11" (1/1) ... [2019-11-15 22:12:11,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:12:11,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:12:11,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:12:11,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:12:11,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:12:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:12:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:12:11,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:12:11,561 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:12:11,561 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:12:11,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:12:11 BoogieIcfgContainer [2019-11-15 22:12:11,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:12:11,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:12:11,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:12:11,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:12:11,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:12:10" (1/3) ... [2019-11-15 22:12:11,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6d4335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:12:11, skipping insertion in model container [2019-11-15 22:12:11,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:12:11" (2/3) ... [2019-11-15 22:12:11,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6d4335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:12:11, skipping insertion in model container [2019-11-15 22:12:11,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:12:11" (3/3) ... [2019-11-15 22:12:11,569 INFO L109 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2019-11-15 22:12:11,594 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:12:11,601 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:12:11,623 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:12:11,644 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:12:11,644 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:12:11,644 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:12:11,645 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:12:11,645 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:12:11,645 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:12:11,645 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:12:11,645 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:12:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-15 22:12:11,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:12:11,669 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:11,670 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:11,672 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:11,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:11,679 INFO L82 PathProgramCache]: Analyzing trace with hash -265415979, now seen corresponding path program 1 times [2019-11-15 22:12:11,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:11,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199613615] [2019-11-15 22:12:11,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:11,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:11,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:11,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199613615] [2019-11-15 22:12:11,815 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:12:11,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:12:11,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088607239] [2019-11-15 22:12:11,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:12:11,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:11,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:12:11,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:12:11,837 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2019-11-15 22:12:11,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:11,939 INFO L93 Difference]: Finished difference Result 34 states and 58 transitions. [2019-11-15 22:12:11,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:12:11,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 22:12:11,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:11,949 INFO L225 Difference]: With dead ends: 34 [2019-11-15 22:12:11,949 INFO L226 Difference]: Without dead ends: 18 [2019-11-15 22:12:11,951 INFO L600 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-11-15 22:12:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-15 22:12:11,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-11-15 22:12:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 22:12:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-11-15 22:12:11,980 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 10 [2019-11-15 22:12:11,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:11,980 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-15 22:12:11,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:12:11,980 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2019-11-15 22:12:11,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:12:11,981 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:11,981 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:11,982 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:11,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:11,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2136724782, now seen corresponding path program 1 times [2019-11-15 22:12:11,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:11,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342537279] [2019-11-15 22:12:11,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:11,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:11,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:12,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342537279] [2019-11-15 22:12:12,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:12:12,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:12:12,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089442715] [2019-11-15 22:12:12,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:12:12,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:12,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:12:12,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:12:12,037 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. Second operand 4 states. [2019-11-15 22:12:12,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:12,102 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-11-15 22:12:12,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:12:12,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-15 22:12:12,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:12,103 INFO L225 Difference]: With dead ends: 31 [2019-11-15 22:12:12,103 INFO L226 Difference]: Without dead ends: 18 [2019-11-15 22:12:12,104 INFO L600 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-11-15 22:12:12,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-15 22:12:12,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-11-15 22:12:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 22:12:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-15 22:12:12,108 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2019-11-15 22:12:12,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:12,108 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 22:12:12,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:12:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2019-11-15 22:12:12,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:12:12,109 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:12,109 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:12,109 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:12,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:12,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1478184144, now seen corresponding path program 1 times [2019-11-15 22:12:12,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:12,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125268519] [2019-11-15 22:12:12,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:12,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:12,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:12:12,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125268519] [2019-11-15 22:12:12,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:12:12,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:12:12,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056155351] [2019-11-15 22:12:12,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:12:12,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:12,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:12:12,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:12:12,144 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 3 states. [2019-11-15 22:12:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:12,174 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2019-11-15 22:12:12,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:12:12,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-15 22:12:12,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:12,176 INFO L225 Difference]: With dead ends: 42 [2019-11-15 22:12:12,176 INFO L226 Difference]: Without dead ends: 28 [2019-11-15 22:12:12,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:12:12,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-15 22:12:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-11-15 22:12:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 22:12:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2019-11-15 22:12:12,182 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 13 [2019-11-15 22:12:12,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:12,182 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-15 22:12:12,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:12:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2019-11-15 22:12:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 22:12:12,183 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:12,183 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:12,184 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:12,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:12,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1047433017, now seen corresponding path program 1 times [2019-11-15 22:12:12,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:12,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855712852] [2019-11-15 22:12:12,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:12,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:12,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:12,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855712852] [2019-11-15 22:12:12,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487684755] [2019-11-15 22:12:12,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:12,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:12:12,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:12,401 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:12,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-11-15 22:12:12,401 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460017310] [2019-11-15 22:12:12,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:12:12,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:12,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:12:12,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:12:12,403 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand 10 states. [2019-11-15 22:12:12,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:12,632 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2019-11-15 22:12:12,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:12:12,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-11-15 22:12:12,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:12,636 INFO L225 Difference]: With dead ends: 70 [2019-11-15 22:12:12,636 INFO L226 Difference]: Without dead ends: 51 [2019-11-15 22:12:12,637 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:12:12,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-15 22:12:12,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 23. [2019-11-15 22:12:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 22:12:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-15 22:12:12,644 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2019-11-15 22:12:12,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:12,644 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-15 22:12:12,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:12:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-11-15 22:12:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 22:12:12,646 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:12,646 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:12,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:12,851 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:12,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:12,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1825215219, now seen corresponding path program 1 times [2019-11-15 22:12:12,851 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:12,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18053917] [2019-11-15 22:12:12,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:12,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:12,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:12,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 22:12:12,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18053917] [2019-11-15 22:12:12,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:12:12,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:12:12,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584844498] [2019-11-15 22:12:12,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:12:12,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:12,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:12:12,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:12:12,889 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 3 states. [2019-11-15 22:12:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:12,935 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2019-11-15 22:12:12,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:12:12,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-15 22:12:12,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:12,937 INFO L225 Difference]: With dead ends: 52 [2019-11-15 22:12:12,937 INFO L226 Difference]: Without dead ends: 31 [2019-11-15 22:12:12,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:12:12,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-15 22:12:12,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-11-15 22:12:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 22:12:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-15 22:12:12,943 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2019-11-15 22:12:12,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:12,944 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-15 22:12:12,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:12:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-11-15 22:12:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 22:12:12,945 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:12,945 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:12,946 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:12,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:12,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1882473521, now seen corresponding path program 1 times [2019-11-15 22:12:12,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:12,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631372503] [2019-11-15 22:12:12,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:12,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:12,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 22:12:13,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631372503] [2019-11-15 22:12:13,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:12:13,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:12:13,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212376414] [2019-11-15 22:12:13,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:12:13,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:13,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:12:13,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:12:13,016 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 4 states. [2019-11-15 22:12:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:13,067 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2019-11-15 22:12:13,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:12:13,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-15 22:12:13,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:13,068 INFO L225 Difference]: With dead ends: 65 [2019-11-15 22:12:13,068 INFO L226 Difference]: Without dead ends: 44 [2019-11-15 22:12:13,069 INFO L600 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-11-15 22:12:13,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-15 22:12:13,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-11-15 22:12:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 22:12:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2019-11-15 22:12:13,076 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 16 [2019-11-15 22:12:13,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:13,076 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2019-11-15 22:12:13,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:12:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2019-11-15 22:12:13,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 22:12:13,077 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:13,077 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:13,078 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:13,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:13,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1882533103, now seen corresponding path program 1 times [2019-11-15 22:12:13,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:13,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426099096] [2019-11-15 22:12:13,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:13,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:13,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:13,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426099096] [2019-11-15 22:12:13,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144298078] [2019-11-15 22:12:13,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:13,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:12:13,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:13,262 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:13,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-11-15 22:12:13,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583137227] [2019-11-15 22:12:13,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:12:13,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:13,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:12:13,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:12:13,263 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand 10 states. [2019-11-15 22:12:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:13,636 INFO L93 Difference]: Finished difference Result 161 states and 229 transitions. [2019-11-15 22:12:13,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:12:13,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-15 22:12:13,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:13,639 INFO L225 Difference]: With dead ends: 161 [2019-11-15 22:12:13,639 INFO L226 Difference]: Without dead ends: 121 [2019-11-15 22:12:13,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-11-15 22:12:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-15 22:12:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 82. [2019-11-15 22:12:13,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-15 22:12:13,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 109 transitions. [2019-11-15 22:12:13,666 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 109 transitions. Word has length 16 [2019-11-15 22:12:13,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:13,667 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 109 transitions. [2019-11-15 22:12:13,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:12:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2019-11-15 22:12:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 22:12:13,668 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:13,668 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:13,878 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:13,878 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:13,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:13,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1169498870, now seen corresponding path program 2 times [2019-11-15 22:12:13,879 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:13,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836453039] [2019-11-15 22:12:13,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:13,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:13,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:13,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836453039] [2019-11-15 22:12:13,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679399395] [2019-11-15 22:12:13,971 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:14,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:12:14,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:14,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:12:14,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:14,083 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:14,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-15 22:12:14,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658384144] [2019-11-15 22:12:14,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:12:14,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:14,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:12:14,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:12:14,084 INFO L87 Difference]: Start difference. First operand 82 states and 109 transitions. Second operand 13 states. [2019-11-15 22:12:14,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:14,307 INFO L93 Difference]: Finished difference Result 221 states and 301 transitions. [2019-11-15 22:12:14,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:12:14,311 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-11-15 22:12:14,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:14,312 INFO L225 Difference]: With dead ends: 221 [2019-11-15 22:12:14,312 INFO L226 Difference]: Without dead ends: 141 [2019-11-15 22:12:14,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:12:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-15 22:12:14,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 84. [2019-11-15 22:12:14,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-15 22:12:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2019-11-15 22:12:14,335 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 19 [2019-11-15 22:12:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:14,335 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2019-11-15 22:12:14,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:12:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2019-11-15 22:12:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 22:12:14,336 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:14,337 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:14,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:14,540 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:14,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1256265881, now seen corresponding path program 1 times [2019-11-15 22:12:14,540 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:14,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133457409] [2019-11-15 22:12:14,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:14,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:14,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:14,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133457409] [2019-11-15 22:12:14,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30069750] [2019-11-15 22:12:14,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:14,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:12:14,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:14,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:14,728 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:14,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-15 22:12:14,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264821951] [2019-11-15 22:12:14,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 22:12:14,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:14,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:12:14,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:12:14,729 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand 11 states. [2019-11-15 22:12:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:14,820 INFO L93 Difference]: Finished difference Result 197 states and 265 transitions. [2019-11-15 22:12:14,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:12:14,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-11-15 22:12:14,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:14,824 INFO L225 Difference]: With dead ends: 197 [2019-11-15 22:12:14,825 INFO L226 Difference]: Without dead ends: 115 [2019-11-15 22:12:14,826 INFO L600 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-11-15 22:12:14,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-15 22:12:14,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 94. [2019-11-15 22:12:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-15 22:12:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2019-11-15 22:12:14,839 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 125 transitions. Word has length 20 [2019-11-15 22:12:14,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:14,839 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 125 transitions. [2019-11-15 22:12:14,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 22:12:14,839 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions. [2019-11-15 22:12:14,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 22:12:14,840 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:14,840 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:15,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:15,046 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:15,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:15,047 INFO L82 PathProgramCache]: Analyzing trace with hash 203649807, now seen corresponding path program 3 times [2019-11-15 22:12:15,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:15,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335489405] [2019-11-15 22:12:15,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:15,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:15,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:15,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335489405] [2019-11-15 22:12:15,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118355739] [2019-11-15 22:12:15,138 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:15,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-15 22:12:15,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:15,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:12:15,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 22:12:15,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:12:15,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2019-11-15 22:12:15,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594699535] [2019-11-15 22:12:15,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:12:15,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:15,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:12:15,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:12:15,211 INFO L87 Difference]: Start difference. First operand 94 states and 125 transitions. Second operand 4 states. [2019-11-15 22:12:15,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:15,263 INFO L93 Difference]: Finished difference Result 218 states and 288 transitions. [2019-11-15 22:12:15,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:12:15,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-15 22:12:15,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:15,265 INFO L225 Difference]: With dead ends: 218 [2019-11-15 22:12:15,265 INFO L226 Difference]: Without dead ends: 126 [2019-11-15 22:12:15,269 INFO L600 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-11-15 22:12:15,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-15 22:12:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 104. [2019-11-15 22:12:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 22:12:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 131 transitions. [2019-11-15 22:12:15,290 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 131 transitions. Word has length 22 [2019-11-15 22:12:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:15,292 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 131 transitions. [2019-11-15 22:12:15,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:12:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2019-11-15 22:12:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:12:15,294 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:15,294 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:15,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:15,498 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:15,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:15,498 INFO L82 PathProgramCache]: Analyzing trace with hash -617261500, now seen corresponding path program 2 times [2019-11-15 22:12:15,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:15,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114093141] [2019-11-15 22:12:15,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:15,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:15,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:15,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114093141] [2019-11-15 22:12:15,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848675175] [2019-11-15 22:12:15,599 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:15,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:12:15,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:15,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:12:15,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:15,699 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:15,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-15 22:12:15,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910573749] [2019-11-15 22:12:15,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:12:15,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:15,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:12:15,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:12:15,700 INFO L87 Difference]: Start difference. First operand 104 states and 131 transitions. Second operand 13 states. [2019-11-15 22:12:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:15,824 INFO L93 Difference]: Finished difference Result 249 states and 317 transitions. [2019-11-15 22:12:15,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:12:15,825 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-15 22:12:15,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:15,826 INFO L225 Difference]: With dead ends: 249 [2019-11-15 22:12:15,826 INFO L226 Difference]: Without dead ends: 147 [2019-11-15 22:12:15,828 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:12:15,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-15 22:12:15,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 126. [2019-11-15 22:12:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 22:12:15,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 157 transitions. [2019-11-15 22:12:15,851 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 157 transitions. Word has length 23 [2019-11-15 22:12:15,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:15,852 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 157 transitions. [2019-11-15 22:12:15,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:12:15,852 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 157 transitions. [2019-11-15 22:12:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:12:15,853 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:15,853 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:16,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:16,058 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:16,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:16,059 INFO L82 PathProgramCache]: Analyzing trace with hash 667196999, now seen corresponding path program 3 times [2019-11-15 22:12:16,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:16,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174758110] [2019-11-15 22:12:16,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:16,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:16,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:16,126 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:16,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174758110] [2019-11-15 22:12:16,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553364889] [2019-11-15 22:12:16,127 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:16,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 22:12:16,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:16,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 22:12:16,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:16,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:12:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-15 22:12:16,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:12:16,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2019-11-15 22:12:16,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119877733] [2019-11-15 22:12:16,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:12:16,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:16,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:12:16,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:12:16,283 INFO L87 Difference]: Start difference. First operand 126 states and 157 transitions. Second operand 8 states. [2019-11-15 22:12:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:16,420 INFO L93 Difference]: Finished difference Result 280 states and 347 transitions. [2019-11-15 22:12:16,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:12:16,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-15 22:12:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:16,423 INFO L225 Difference]: With dead ends: 280 [2019-11-15 22:12:16,423 INFO L226 Difference]: Without dead ends: 278 [2019-11-15 22:12:16,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:12:16,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-15 22:12:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 175. [2019-11-15 22:12:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-15 22:12:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2019-11-15 22:12:16,438 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 26 [2019-11-15 22:12:16,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:16,438 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 216 transitions. [2019-11-15 22:12:16,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:12:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2019-11-15 22:12:16,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:12:16,439 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:16,440 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:16,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:16,652 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:16,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:16,652 INFO L82 PathProgramCache]: Analyzing trace with hash 475238213, now seen corresponding path program 1 times [2019-11-15 22:12:16,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:16,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72076564] [2019-11-15 22:12:16,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:16,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:16,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 22:12:16,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72076564] [2019-11-15 22:12:16,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:12:16,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:12:16,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081918352] [2019-11-15 22:12:16,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:12:16,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:16,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:12:16,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:12:16,682 INFO L87 Difference]: Start difference. First operand 175 states and 216 transitions. Second operand 4 states. [2019-11-15 22:12:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:16,717 INFO L93 Difference]: Finished difference Result 260 states and 323 transitions. [2019-11-15 22:12:16,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:12:16,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-15 22:12:16,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:16,719 INFO L225 Difference]: With dead ends: 260 [2019-11-15 22:12:16,719 INFO L226 Difference]: Without dead ends: 194 [2019-11-15 22:12:16,719 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:12:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-15 22:12:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2019-11-15 22:12:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-11-15 22:12:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 222 transitions. [2019-11-15 22:12:16,732 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 222 transitions. Word has length 26 [2019-11-15 22:12:16,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:16,732 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 222 transitions. [2019-11-15 22:12:16,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:12:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 222 transitions. [2019-11-15 22:12:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:12:16,734 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:16,734 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:16,734 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:16,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:16,734 INFO L82 PathProgramCache]: Analyzing trace with hash 477144837, now seen corresponding path program 1 times [2019-11-15 22:12:16,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:16,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858188190] [2019-11-15 22:12:16,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:16,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:16,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:12:16,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858188190] [2019-11-15 22:12:16,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593504330] [2019-11-15 22:12:16,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:16,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:12:16,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:16,989 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:16,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-15 22:12:16,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94069395] [2019-11-15 22:12:16,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 22:12:16,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:16,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:12:16,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:12:16,990 INFO L87 Difference]: Start difference. First operand 181 states and 222 transitions. Second operand 15 states. [2019-11-15 22:12:17,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:17,367 INFO L93 Difference]: Finished difference Result 483 states and 604 transitions. [2019-11-15 22:12:17,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 22:12:17,367 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-11-15 22:12:17,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:17,370 INFO L225 Difference]: With dead ends: 483 [2019-11-15 22:12:17,370 INFO L226 Difference]: Without dead ends: 337 [2019-11-15 22:12:17,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=256, Invalid=614, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:12:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-11-15 22:12:17,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 205. [2019-11-15 22:12:17,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-15 22:12:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 251 transitions. [2019-11-15 22:12:17,386 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 251 transitions. Word has length 26 [2019-11-15 22:12:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:17,387 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 251 transitions. [2019-11-15 22:12:17,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 22:12:17,387 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 251 transitions. [2019-11-15 22:12:17,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:12:17,388 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:17,388 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:17,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:17,594 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:17,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:17,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2135503200, now seen corresponding path program 2 times [2019-11-15 22:12:17,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:17,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417301191] [2019-11-15 22:12:17,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:17,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:17,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:12:17,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417301191] [2019-11-15 22:12:17,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779686432] [2019-11-15 22:12:17,681 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:17,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:12:17,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:17,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:12:17,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:12:17,831 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:17,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-15 22:12:17,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327330741] [2019-11-15 22:12:17,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 22:12:17,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 22:12:17,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:12:17,832 INFO L87 Difference]: Start difference. First operand 205 states and 251 transitions. Second operand 17 states. [2019-11-15 22:12:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:18,081 INFO L93 Difference]: Finished difference Result 424 states and 525 transitions. [2019-11-15 22:12:18,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 22:12:18,082 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-11-15 22:12:18,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:18,084 INFO L225 Difference]: With dead ends: 424 [2019-11-15 22:12:18,084 INFO L226 Difference]: Without dead ends: 278 [2019-11-15 22:12:18,084 INFO L600 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-11-15 22:12:18,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-15 22:12:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 199. [2019-11-15 22:12:18,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-15 22:12:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 245 transitions. [2019-11-15 22:12:18,101 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 245 transitions. Word has length 29 [2019-11-15 22:12:18,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:18,101 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 245 transitions. [2019-11-15 22:12:18,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 22:12:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 245 transitions. [2019-11-15 22:12:18,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:12:18,102 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:18,102 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:18,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:18,306 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:18,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:18,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1548697186, now seen corresponding path program 3 times [2019-11-15 22:12:18,306 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:18,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106995526] [2019-11-15 22:12:18,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:18,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:18,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:18,400 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:18,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106995526] [2019-11-15 22:12:18,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619828852] [2019-11-15 22:12:18,400 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:18,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 22:12:18,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:18,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 22:12:18,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:18,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:12:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-15 22:12:18,643 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:12:18,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2019-11-15 22:12:18,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873184657] [2019-11-15 22:12:18,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:12:18,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:18,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:12:18,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:12:18,646 INFO L87 Difference]: Start difference. First operand 199 states and 245 transitions. Second operand 8 states. [2019-11-15 22:12:18,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:18,790 INFO L93 Difference]: Finished difference Result 258 states and 315 transitions. [2019-11-15 22:12:18,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:12:18,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-15 22:12:18,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:18,792 INFO L225 Difference]: With dead ends: 258 [2019-11-15 22:12:18,793 INFO L226 Difference]: Without dead ends: 256 [2019-11-15 22:12:18,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:12:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-15 22:12:18,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 199. [2019-11-15 22:12:18,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-15 22:12:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 245 transitions. [2019-11-15 22:12:18,812 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 245 transitions. Word has length 29 [2019-11-15 22:12:18,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:18,812 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 245 transitions. [2019-11-15 22:12:18,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:12:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 245 transitions. [2019-11-15 22:12:18,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:12:18,813 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:18,813 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:19,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:19,016 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:19,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:19,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1366196382, now seen corresponding path program 2 times [2019-11-15 22:12:19,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:19,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43119903] [2019-11-15 22:12:19,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:19,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:19,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:19,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43119903] [2019-11-15 22:12:19,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124535766] [2019-11-15 22:12:19,186 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:19,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-15 22:12:19,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:19,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:12:19,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-15 22:12:19,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:12:19,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2019-11-15 22:12:19,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626685347] [2019-11-15 22:12:19,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:12:19,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:19,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:12:19,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:12:19,273 INFO L87 Difference]: Start difference. First operand 199 states and 245 transitions. Second operand 5 states. [2019-11-15 22:12:19,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:19,322 INFO L93 Difference]: Finished difference Result 345 states and 426 transitions. [2019-11-15 22:12:19,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:12:19,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-15 22:12:19,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:19,324 INFO L225 Difference]: With dead ends: 345 [2019-11-15 22:12:19,324 INFO L226 Difference]: Without dead ends: 273 [2019-11-15 22:12:19,325 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:12:19,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-15 22:12:19,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 231. [2019-11-15 22:12:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-15 22:12:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 286 transitions. [2019-11-15 22:12:19,341 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 286 transitions. Word has length 29 [2019-11-15 22:12:19,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:19,342 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 286 transitions. [2019-11-15 22:12:19,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:12:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 286 transitions. [2019-11-15 22:12:19,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 22:12:19,343 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:19,343 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 22:12:19,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:19,547 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:19,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:19,547 INFO L82 PathProgramCache]: Analyzing trace with hash 531419276, now seen corresponding path program 1 times [2019-11-15 22:12:19,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:19,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102854172] [2019-11-15 22:12:19,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:19,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:19,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 34 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:19,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102854172] [2019-11-15 22:12:19,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944277532] [2019-11-15 22:12:19,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:19,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:12:19,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 122 proven. 51 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-15 22:12:19,956 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:19,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 25 [2019-11-15 22:12:19,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148964183] [2019-11-15 22:12:19,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 22:12:19,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:19,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 22:12:19,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2019-11-15 22:12:19,958 INFO L87 Difference]: Start difference. First operand 231 states and 286 transitions. Second operand 26 states. [2019-11-15 22:12:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:20,383 INFO L93 Difference]: Finished difference Result 551 states and 679 transitions. [2019-11-15 22:12:20,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 22:12:20,384 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-11-15 22:12:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:20,386 INFO L225 Difference]: With dead ends: 551 [2019-11-15 22:12:20,386 INFO L226 Difference]: Without dead ends: 359 [2019-11-15 22:12:20,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=308, Invalid=1098, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 22:12:20,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-15 22:12:20,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 266. [2019-11-15 22:12:20,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-15 22:12:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 327 transitions. [2019-11-15 22:12:20,405 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 327 transitions. Word has length 55 [2019-11-15 22:12:20,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:20,405 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 327 transitions. [2019-11-15 22:12:20,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 22:12:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 327 transitions. [2019-11-15 22:12:20,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 22:12:20,406 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:20,407 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 22:12:20,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:20,611 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:20,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:20,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1993539556, now seen corresponding path program 2 times [2019-11-15 22:12:20,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:20,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369812149] [2019-11-15 22:12:20,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:20,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:20,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 39 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:20,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369812149] [2019-11-15 22:12:20,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339801295] [2019-11-15 22:12:20,831 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:20,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:12:20,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:20,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:12:20,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 163 proven. 70 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-11-15 22:12:21,021 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:21,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 28 [2019-11-15 22:12:21,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461692654] [2019-11-15 22:12:21,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 22:12:21,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:21,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 22:12:21,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2019-11-15 22:12:21,023 INFO L87 Difference]: Start difference. First operand 266 states and 327 transitions. Second operand 29 states. [2019-11-15 22:12:21,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:21,512 INFO L93 Difference]: Finished difference Result 644 states and 783 transitions. [2019-11-15 22:12:21,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 22:12:21,513 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 61 [2019-11-15 22:12:21,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:21,515 INFO L225 Difference]: With dead ends: 644 [2019-11-15 22:12:21,516 INFO L226 Difference]: Without dead ends: 425 [2019-11-15 22:12:21,517 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=437, Invalid=1543, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 22:12:21,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-11-15 22:12:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 305. [2019-11-15 22:12:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-15 22:12:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 372 transitions. [2019-11-15 22:12:21,537 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 372 transitions. Word has length 61 [2019-11-15 22:12:21,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:21,538 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 372 transitions. [2019-11-15 22:12:21,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 22:12:21,538 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 372 transitions. [2019-11-15 22:12:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:12:21,539 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:21,539 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 14, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 22:12:21,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:21,742 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:21,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:21,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1561582796, now seen corresponding path program 3 times [2019-11-15 22:12:21,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:21,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117987130] [2019-11-15 22:12:21,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:21,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:21,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 44 proven. 356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:22,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117987130] [2019-11-15 22:12:22,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29207872] [2019-11-15 22:12:22,038 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:22,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 22:12:22,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:22,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 22:12:22,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:22,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:12:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 22 proven. 216 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-11-15 22:12:22,221 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:22,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9] total 30 [2019-11-15 22:12:22,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440642454] [2019-11-15 22:12:22,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 22:12:22,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:22,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 22:12:22,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:12:22,223 INFO L87 Difference]: Start difference. First operand 305 states and 372 transitions. Second operand 30 states. [2019-11-15 22:12:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:26,724 INFO L93 Difference]: Finished difference Result 1614 states and 1904 transitions. [2019-11-15 22:12:26,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-11-15 22:12:26,725 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-11-15 22:12:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:26,732 INFO L225 Difference]: With dead ends: 1614 [2019-11-15 22:12:26,732 INFO L226 Difference]: Without dead ends: 1512 [2019-11-15 22:12:26,741 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11671 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4550, Invalid=24180, Unknown=0, NotChecked=0, Total=28730 [2019-11-15 22:12:26,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2019-11-15 22:12:26,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 644. [2019-11-15 22:12:26,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-11-15 22:12:26,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 755 transitions. [2019-11-15 22:12:26,800 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 755 transitions. Word has length 67 [2019-11-15 22:12:26,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:26,800 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 755 transitions. [2019-11-15 22:12:26,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 22:12:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 755 transitions. [2019-11-15 22:12:26,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:12:26,802 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:26,802 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 10, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:27,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:27,013 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash -577843254, now seen corresponding path program 1 times [2019-11-15 22:12:27,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:27,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80741935] [2019-11-15 22:12:27,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:27,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:27,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 26 proven. 374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:27,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80741935] [2019-11-15 22:12:27,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121038149] [2019-11-15 22:12:27,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:27,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 22:12:27,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 92 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-15 22:12:27,607 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:27,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 11] total 34 [2019-11-15 22:12:27,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297703329] [2019-11-15 22:12:27,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 22:12:27,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:27,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 22:12:27,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=982, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 22:12:27,609 INFO L87 Difference]: Start difference. First operand 644 states and 755 transitions. Second operand 35 states. [2019-11-15 22:12:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:30,508 INFO L93 Difference]: Finished difference Result 2064 states and 2515 transitions. [2019-11-15 22:12:30,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-11-15 22:12:30,509 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-11-15 22:12:30,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:30,518 INFO L225 Difference]: With dead ends: 2064 [2019-11-15 22:12:30,518 INFO L226 Difference]: Without dead ends: 1493 [2019-11-15 22:12:30,523 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4387 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2552, Invalid=11728, Unknown=0, NotChecked=0, Total=14280 [2019-11-15 22:12:30,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2019-11-15 22:12:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 501. [2019-11-15 22:12:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-11-15 22:12:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 608 transitions. [2019-11-15 22:12:30,570 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 608 transitions. Word has length 67 [2019-11-15 22:12:30,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:30,570 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 608 transitions. [2019-11-15 22:12:30,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 22:12:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 608 transitions. [2019-11-15 22:12:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 22:12:30,571 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:30,572 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 12, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:30,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:30,775 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:30,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:30,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2091458462, now seen corresponding path program 2 times [2019-11-15 22:12:30,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:30,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724583562] [2019-11-15 22:12:30,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:30,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:30,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:31,190 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 34 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:31,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724583562] [2019-11-15 22:12:31,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793037215] [2019-11-15 22:12:31,191 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:31,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:12:31,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:31,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:12:31,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 263 proven. 117 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-15 22:12:31,533 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:31,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 12] total 37 [2019-11-15 22:12:31,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371866358] [2019-11-15 22:12:31,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-15 22:12:31,533 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:31,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-15 22:12:31,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1168, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 22:12:31,534 INFO L87 Difference]: Start difference. First operand 501 states and 608 transitions. Second operand 38 states. [2019-11-15 22:12:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:35,008 INFO L93 Difference]: Finished difference Result 1888 states and 2315 transitions. [2019-11-15 22:12:35,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-11-15 22:12:35,010 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2019-11-15 22:12:35,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:35,017 INFO L225 Difference]: With dead ends: 1888 [2019-11-15 22:12:35,017 INFO L226 Difference]: Without dead ends: 1452 [2019-11-15 22:12:35,023 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5281 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3026, Invalid=14004, Unknown=0, NotChecked=0, Total=17030 [2019-11-15 22:12:35,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2019-11-15 22:12:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 558. [2019-11-15 22:12:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-11-15 22:12:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 674 transitions. [2019-11-15 22:12:35,077 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 674 transitions. Word has length 73 [2019-11-15 22:12:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:35,077 INFO L462 AbstractCegarLoop]: Abstraction has 558 states and 674 transitions. [2019-11-15 22:12:35,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-15 22:12:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 674 transitions. [2019-11-15 22:12:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 22:12:35,079 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:35,079 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 14, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:35,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:35,283 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:35,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:35,283 INFO L82 PathProgramCache]: Analyzing trace with hash 2051483018, now seen corresponding path program 3 times [2019-11-15 22:12:35,283 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:35,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661960338] [2019-11-15 22:12:35,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:35,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:35,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 45 proven. 573 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:12:35,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661960338] [2019-11-15 22:12:35,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275735477] [2019-11-15 22:12:35,671 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:35,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 22:12:35,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:35,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:12:35,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 355 proven. 1 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-11-15 22:12:35,896 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:35,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 8] total 36 [2019-11-15 22:12:35,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330085376] [2019-11-15 22:12:35,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-15 22:12:35,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:35,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-15 22:12:35,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 22:12:35,898 INFO L87 Difference]: Start difference. First operand 558 states and 674 transitions. Second operand 36 states. [2019-11-15 22:12:38,223 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-11-15 22:12:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:39,691 INFO L93 Difference]: Finished difference Result 1347 states and 1622 transitions. [2019-11-15 22:12:39,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-11-15 22:12:39,692 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2019-11-15 22:12:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:39,695 INFO L225 Difference]: With dead ends: 1347 [2019-11-15 22:12:39,695 INFO L226 Difference]: Without dead ends: 952 [2019-11-15 22:12:39,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6788 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3236, Invalid=17356, Unknown=0, NotChecked=0, Total=20592 [2019-11-15 22:12:39,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-11-15 22:12:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 691. [2019-11-15 22:12:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-11-15 22:12:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 788 transitions. [2019-11-15 22:12:39,779 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 788 transitions. Word has length 79 [2019-11-15 22:12:39,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:39,779 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 788 transitions. [2019-11-15 22:12:39,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-15 22:12:39,779 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 788 transitions. [2019-11-15 22:12:39,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 22:12:39,781 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:39,781 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:39,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:39,985 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:39,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:39,985 INFO L82 PathProgramCache]: Analyzing trace with hash -741345910, now seen corresponding path program 4 times [2019-11-15 22:12:39,985 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:39,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330979919] [2019-11-15 22:12:39,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:39,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:39,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 31 proven. 547 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 22:12:40,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330979919] [2019-11-15 22:12:40,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325722496] [2019-11-15 22:12:40,278 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:40,378 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:12:40,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:40,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 22:12:40,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 297 proven. 295 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 22:12:40,781 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:40,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 41 [2019-11-15 22:12:40,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777350765] [2019-11-15 22:12:40,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-15 22:12:40,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:40,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-15 22:12:40,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1435, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 22:12:40,783 INFO L87 Difference]: Start difference. First operand 691 states and 788 transitions. Second operand 41 states. [2019-11-15 22:12:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:44,233 INFO L93 Difference]: Finished difference Result 1706 states and 1934 transitions. [2019-11-15 22:12:44,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-11-15 22:12:44,233 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-11-15 22:12:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:44,238 INFO L225 Difference]: With dead ends: 1706 [2019-11-15 22:12:44,238 INFO L226 Difference]: Without dead ends: 1228 [2019-11-15 22:12:44,239 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4517 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2905, Invalid=13097, Unknown=0, NotChecked=0, Total=16002 [2019-11-15 22:12:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-11-15 22:12:44,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 464. [2019-11-15 22:12:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-11-15 22:12:44,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 532 transitions. [2019-11-15 22:12:44,282 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 532 transitions. Word has length 79 [2019-11-15 22:12:44,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:44,283 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 532 transitions. [2019-11-15 22:12:44,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-15 22:12:44,283 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 532 transitions. [2019-11-15 22:12:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 22:12:44,284 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:44,284 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 15, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 22:12:44,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:44,488 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:44,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:44,488 INFO L82 PathProgramCache]: Analyzing trace with hash -216004410, now seen corresponding path program 1 times [2019-11-15 22:12:44,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:44,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336120890] [2019-11-15 22:12:44,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:44,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:44,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 103 proven. 513 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:12:44,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336120890] [2019-11-15 22:12:44,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147444809] [2019-11-15 22:12:44,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:45,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:12:45,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 322 proven. 145 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-11-15 22:12:45,274 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:45,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13] total 40 [2019-11-15 22:12:45,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064462180] [2019-11-15 22:12:45,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-15 22:12:45,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:45,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-15 22:12:45,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1402, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 22:12:45,276 INFO L87 Difference]: Start difference. First operand 464 states and 532 transitions. Second operand 41 states. [2019-11-15 22:12:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:47,504 INFO L93 Difference]: Finished difference Result 1055 states and 1220 transitions. [2019-11-15 22:12:47,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-11-15 22:12:47,506 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-11-15 22:12:47,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:47,508 INFO L225 Difference]: With dead ends: 1055 [2019-11-15 22:12:47,508 INFO L226 Difference]: Without dead ends: 609 [2019-11-15 22:12:47,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4014 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2656, Invalid=10226, Unknown=0, NotChecked=0, Total=12882 [2019-11-15 22:12:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-11-15 22:12:47,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 544. [2019-11-15 22:12:47,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-11-15 22:12:47,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 620 transitions. [2019-11-15 22:12:47,557 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 620 transitions. Word has length 79 [2019-11-15 22:12:47,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:47,557 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 620 transitions. [2019-11-15 22:12:47,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-15 22:12:47,557 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 620 transitions. [2019-11-15 22:12:47,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 22:12:47,559 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:47,559 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 12, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:47,762 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:47,762 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:47,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:47,762 INFO L82 PathProgramCache]: Analyzing trace with hash 600454234, now seen corresponding path program 5 times [2019-11-15 22:12:47,762 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:47,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255539770] [2019-11-15 22:12:47,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:47,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:47,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 31 proven. 657 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-15 22:12:48,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255539770] [2019-11-15 22:12:48,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758476640] [2019-11-15 22:12:48,050 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:48,178 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-11-15 22:12:48,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:48,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:12:48,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 387 proven. 176 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-11-15 22:12:48,513 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:48,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 35 [2019-11-15 22:12:48,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263986916] [2019-11-15 22:12:48,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-15 22:12:48,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:48,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-15 22:12:48,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 22:12:48,515 INFO L87 Difference]: Start difference. First operand 544 states and 620 transitions. Second operand 36 states. [2019-11-15 22:12:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:49,121 INFO L93 Difference]: Finished difference Result 1116 states and 1284 transitions. [2019-11-15 22:12:49,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-15 22:12:49,122 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 85 [2019-11-15 22:12:49,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:49,124 INFO L225 Difference]: With dead ends: 1116 [2019-11-15 22:12:49,124 INFO L226 Difference]: Without dead ends: 657 [2019-11-15 22:12:49,125 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=763, Invalid=2543, Unknown=0, NotChecked=0, Total=3306 [2019-11-15 22:12:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-11-15 22:12:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 592. [2019-11-15 22:12:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-15 22:12:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 671 transitions. [2019-11-15 22:12:49,180 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 671 transitions. Word has length 85 [2019-11-15 22:12:49,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:49,181 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 671 transitions. [2019-11-15 22:12:49,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-15 22:12:49,181 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 671 transitions. [2019-11-15 22:12:49,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 22:12:49,182 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:49,182 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 12, 12, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:12:49,386 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:49,386 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:49,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:49,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1846584762, now seen corresponding path program 6 times [2019-11-15 22:12:49,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:49,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432105108] [2019-11-15 22:12:49,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:49,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:49,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 45 proven. 782 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-15 22:12:49,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432105108] [2019-11-15 22:12:49,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807630773] [2019-11-15 22:12:49,672 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:49,777 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-15 22:12:49,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:49,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 22:12:49,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:49,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:12:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 34 proven. 464 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-11-15 22:12:49,945 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:49,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 9] total 33 [2019-11-15 22:12:49,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481299380] [2019-11-15 22:12:49,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 22:12:49,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:49,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 22:12:49,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 22:12:49,945 INFO L87 Difference]: Start difference. First operand 592 states and 671 transitions. Second operand 33 states. [2019-11-15 22:12:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:54,396 INFO L93 Difference]: Finished difference Result 1813 states and 2060 transitions. [2019-11-15 22:12:54,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-11-15 22:12:54,396 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 91 [2019-11-15 22:12:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:54,401 INFO L225 Difference]: With dead ends: 1813 [2019-11-15 22:12:54,401 INFO L226 Difference]: Without dead ends: 1509 [2019-11-15 22:12:54,403 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11608 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4196, Invalid=26254, Unknown=0, NotChecked=0, Total=30450 [2019-11-15 22:12:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2019-11-15 22:12:54,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 703. [2019-11-15 22:12:54,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-11-15 22:12:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 799 transitions. [2019-11-15 22:12:54,470 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 799 transitions. Word has length 91 [2019-11-15 22:12:54,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:54,470 INFO L462 AbstractCegarLoop]: Abstraction has 703 states and 799 transitions. [2019-11-15 22:12:54,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 22:12:54,470 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 799 transitions. [2019-11-15 22:12:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 22:12:54,472 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:54,472 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 18, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 22:12:54,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:54,675 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:54,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:54,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1046927688, now seen corresponding path program 2 times [2019-11-15 22:12:54,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:54,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756536474] [2019-11-15 22:12:54,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:54,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:54,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 166 proven. 716 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:12:55,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756536474] [2019-11-15 22:12:55,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554137207] [2019-11-15 22:12:55,196 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:55,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:12:55,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:55,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:12:55,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 6 proven. 469 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-11-15 22:12:55,553 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:55,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12] total 43 [2019-11-15 22:12:55,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629700858] [2019-11-15 22:12:55,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-15 22:12:55,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:55,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-15 22:12:55,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1639, Unknown=0, NotChecked=0, Total=1892 [2019-11-15 22:12:55,554 INFO L87 Difference]: Start difference. First operand 703 states and 799 transitions. Second operand 44 states. [2019-11-15 22:12:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:12:56,893 INFO L93 Difference]: Finished difference Result 1274 states and 1456 transitions. [2019-11-15 22:12:56,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-11-15 22:12:56,893 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 91 [2019-11-15 22:12:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:12:56,896 INFO L225 Difference]: With dead ends: 1274 [2019-11-15 22:12:56,896 INFO L226 Difference]: Without dead ends: 927 [2019-11-15 22:12:56,897 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2563 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1417, Invalid=7139, Unknown=0, NotChecked=0, Total=8556 [2019-11-15 22:12:56,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-11-15 22:12:56,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 809. [2019-11-15 22:12:56,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2019-11-15 22:12:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 927 transitions. [2019-11-15 22:12:56,969 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 927 transitions. Word has length 91 [2019-11-15 22:12:56,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:12:56,970 INFO L462 AbstractCegarLoop]: Abstraction has 809 states and 927 transitions. [2019-11-15 22:12:56,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-15 22:12:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 927 transitions. [2019-11-15 22:12:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 22:12:56,972 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:12:56,972 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 19, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 22:12:57,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:57,176 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:12:57,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:12:57,176 INFO L82 PathProgramCache]: Analyzing trace with hash 314960262, now seen corresponding path program 3 times [2019-11-15 22:12:57,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:12:57,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703823468] [2019-11-15 22:12:57,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:57,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:12:57,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:12:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:12:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 152 proven. 730 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:12:57,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703823468] [2019-11-15 22:12:57,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303480413] [2019-11-15 22:12:57,682 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:12:57,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-15 22:12:57,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:12:57,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 22:12:57,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:12:57,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:12:57,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:12:57,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:12:57,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:12:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-11-15 22:12:58,032 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:12:58,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 9] total 41 [2019-11-15 22:12:58,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313659711] [2019-11-15 22:12:58,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-15 22:12:58,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:12:58,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-15 22:12:58,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1460, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 22:12:58,034 INFO L87 Difference]: Start difference. First operand 809 states and 927 transitions. Second operand 41 states. [2019-11-15 22:13:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:03,991 INFO L93 Difference]: Finished difference Result 1477 states and 1638 transitions. [2019-11-15 22:13:03,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-11-15 22:13:03,992 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 91 [2019-11-15 22:13:03,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:03,997 INFO L225 Difference]: With dead ends: 1477 [2019-11-15 22:13:03,997 INFO L226 Difference]: Without dead ends: 1238 [2019-11-15 22:13:03,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12933 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5869, Invalid=30041, Unknown=0, NotChecked=0, Total=35910 [2019-11-15 22:13:04,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-11-15 22:13:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 887. [2019-11-15 22:13:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-11-15 22:13:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1011 transitions. [2019-11-15 22:13:04,078 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1011 transitions. Word has length 91 [2019-11-15 22:13:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:04,078 INFO L462 AbstractCegarLoop]: Abstraction has 887 states and 1011 transitions. [2019-11-15 22:13:04,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-15 22:13:04,079 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1011 transitions. [2019-11-15 22:13:04,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 22:13:04,080 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:04,081 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 21, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:04,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:04,292 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:04,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:04,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1277696966, now seen corresponding path program 1 times [2019-11-15 22:13:04,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:04,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166704228] [2019-11-15 22:13:04,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:04,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:04,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:05,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166704228] [2019-11-15 22:13:05,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318095311] [2019-11-15 22:13:05,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:05,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 22:13:05,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:05,749 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 458 proven. 210 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-11-15 22:13:05,749 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:05,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 15] total 50 [2019-11-15 22:13:05,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575811548] [2019-11-15 22:13:05,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-11-15 22:13:05,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:05,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-11-15 22:13:05,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=2160, Unknown=0, NotChecked=0, Total=2550 [2019-11-15 22:13:05,751 INFO L87 Difference]: Start difference. First operand 887 states and 1011 transitions. Second operand 51 states. [2019-11-15 22:13:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:11,696 INFO L93 Difference]: Finished difference Result 2514 states and 2913 transitions. [2019-11-15 22:13:11,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2019-11-15 22:13:11,696 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 91 [2019-11-15 22:13:11,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:11,702 INFO L225 Difference]: With dead ends: 2514 [2019-11-15 22:13:11,702 INFO L226 Difference]: Without dead ends: 1729 [2019-11-15 22:13:11,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15194 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9076, Invalid=33980, Unknown=0, NotChecked=0, Total=43056 [2019-11-15 22:13:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2019-11-15 22:13:11,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1086. [2019-11-15 22:13:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2019-11-15 22:13:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1247 transitions. [2019-11-15 22:13:11,784 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1247 transitions. Word has length 91 [2019-11-15 22:13:11,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:11,785 INFO L462 AbstractCegarLoop]: Abstraction has 1086 states and 1247 transitions. [2019-11-15 22:13:11,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-11-15 22:13:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1247 transitions. [2019-11-15 22:13:11,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:13:11,787 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:11,787 INFO L380 BasicCegarLoop]: trace histogram [26, 26, 22, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:11,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:11,990 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:11,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:11,990 INFO L82 PathProgramCache]: Analyzing trace with hash 763529758, now seen corresponding path program 7 times [2019-11-15 22:13:11,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:11,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984313673] [2019-11-15 22:13:11,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:11,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:11,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 171 proven. 864 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:12,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984313673] [2019-11-15 22:13:12,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905714364] [2019-11-15 22:13:12,560 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 22:13:12,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 535 proven. 247 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-11-15 22:13:13,053 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:13,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 16] total 51 [2019-11-15 22:13:13,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371946442] [2019-11-15 22:13:13,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-11-15 22:13:13,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:13,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-11-15 22:13:13,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2278, Unknown=0, NotChecked=0, Total=2652 [2019-11-15 22:13:13,054 INFO L87 Difference]: Start difference. First operand 1086 states and 1247 transitions. Second operand 52 states. [2019-11-15 22:13:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:21,416 INFO L93 Difference]: Finished difference Result 2867 states and 3266 transitions. [2019-11-15 22:13:21,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2019-11-15 22:13:21,416 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 97 [2019-11-15 22:13:21,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:21,422 INFO L225 Difference]: With dead ends: 2867 [2019-11-15 22:13:21,422 INFO L226 Difference]: Without dead ends: 1843 [2019-11-15 22:13:21,425 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24179 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11872, Invalid=53408, Unknown=0, NotChecked=0, Total=65280 [2019-11-15 22:13:21,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2019-11-15 22:13:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1097. [2019-11-15 22:13:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-11-15 22:13:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1253 transitions. [2019-11-15 22:13:21,502 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1253 transitions. Word has length 97 [2019-11-15 22:13:21,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:21,503 INFO L462 AbstractCegarLoop]: Abstraction has 1097 states and 1253 transitions. [2019-11-15 22:13:21,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-11-15 22:13:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1253 transitions. [2019-11-15 22:13:21,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 22:13:21,505 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:21,505 INFO L380 BasicCegarLoop]: trace histogram [28, 28, 24, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:21,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:21,708 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:21,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:21,708 INFO L82 PathProgramCache]: Analyzing trace with hash -850803962, now seen corresponding path program 8 times [2019-11-15 22:13:21,709 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:21,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871074461] [2019-11-15 22:13:21,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:21,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:21,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 203 proven. 995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:22,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871074461] [2019-11-15 22:13:22,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695679170] [2019-11-15 22:13:22,304 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:22,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:13:22,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:13:22,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 22:13:22,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 618 proven. 287 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-11-15 22:13:22,941 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:22,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 17] total 54 [2019-11-15 22:13:22,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756123101] [2019-11-15 22:13:22,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-15 22:13:22,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:22,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-15 22:13:22,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=2543, Unknown=0, NotChecked=0, Total=2970 [2019-11-15 22:13:22,943 INFO L87 Difference]: Start difference. First operand 1097 states and 1253 transitions. Second operand 55 states. [2019-11-15 22:13:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:32,990 INFO L93 Difference]: Finished difference Result 3278 states and 3733 transitions. [2019-11-15 22:13:32,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-11-15 22:13:32,990 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 103 [2019-11-15 22:13:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:32,997 INFO L225 Difference]: With dead ends: 3278 [2019-11-15 22:13:32,997 INFO L226 Difference]: Without dead ends: 2127 [2019-11-15 22:13:33,001 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29935 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=14766, Invalid=65606, Unknown=0, NotChecked=0, Total=80372 [2019-11-15 22:13:33,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2019-11-15 22:13:33,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1172. [2019-11-15 22:13:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-11-15 22:13:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1335 transitions. [2019-11-15 22:13:33,091 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1335 transitions. Word has length 103 [2019-11-15 22:13:33,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:33,092 INFO L462 AbstractCegarLoop]: Abstraction has 1172 states and 1335 transitions. [2019-11-15 22:13:33,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-15 22:13:33,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1335 transitions. [2019-11-15 22:13:33,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-15 22:13:33,094 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:33,094 INFO L380 BasicCegarLoop]: trace histogram [30, 30, 26, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:33,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:33,297 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:33,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:33,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1300881630, now seen corresponding path program 9 times [2019-11-15 22:13:33,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:33,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759071968] [2019-11-15 22:13:33,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:33,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:33,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 238 proven. 1135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:34,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759071968] [2019-11-15 22:13:34,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228432471] [2019-11-15 22:13:34,003 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:34,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-15 22:13:34,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:13:34,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:13:34,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 741 proven. 0 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-11-15 22:13:34,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:13:34,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [41] total 46 [2019-11-15 22:13:34,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372322918] [2019-11-15 22:13:34,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:13:34,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:34,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:13:34,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1820, Unknown=0, NotChecked=0, Total=2070 [2019-11-15 22:13:34,268 INFO L87 Difference]: Start difference. First operand 1172 states and 1335 transitions. Second operand 6 states. [2019-11-15 22:13:34,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:34,405 INFO L93 Difference]: Finished difference Result 1894 states and 2155 transitions. [2019-11-15 22:13:34,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:13:34,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-11-15 22:13:34,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:34,409 INFO L225 Difference]: With dead ends: 1894 [2019-11-15 22:13:34,409 INFO L226 Difference]: Without dead ends: 1163 [2019-11-15 22:13:34,410 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=262, Invalid=1994, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 22:13:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2019-11-15 22:13:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1090. [2019-11-15 22:13:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-11-15 22:13:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1237 transitions. [2019-11-15 22:13:34,484 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1237 transitions. Word has length 109 [2019-11-15 22:13:34,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:34,484 INFO L462 AbstractCegarLoop]: Abstraction has 1090 states and 1237 transitions. [2019-11-15 22:13:34,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:13:34,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1237 transitions. [2019-11-15 22:13:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-15 22:13:34,486 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:34,486 INFO L380 BasicCegarLoop]: trace histogram [30, 30, 28, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:34,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:34,689 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:34,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:34,689 INFO L82 PathProgramCache]: Analyzing trace with hash 883309212, now seen corresponding path program 2 times [2019-11-15 22:13:34,690 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:34,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916381270] [2019-11-15 22:13:34,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:34,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:34,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 0 proven. 1371 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:13:35,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916381270] [2019-11-15 22:13:35,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208441831] [2019-11-15 22:13:35,503 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:35,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:13:35,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:13:35,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 22:13:35,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 4 proven. 957 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2019-11-15 22:13:36,065 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:36,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 17] total 53 [2019-11-15 22:13:36,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413479049] [2019-11-15 22:13:36,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-11-15 22:13:36,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:36,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-11-15 22:13:36,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=2296, Unknown=0, NotChecked=0, Total=2862 [2019-11-15 22:13:36,067 INFO L87 Difference]: Start difference. First operand 1090 states and 1237 transitions. Second operand 54 states. [2019-11-15 22:13:37,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:37,481 INFO L93 Difference]: Finished difference Result 1399 states and 1589 transitions. [2019-11-15 22:13:37,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-11-15 22:13:37,482 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 109 [2019-11-15 22:13:37,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:37,486 INFO L225 Difference]: With dead ends: 1399 [2019-11-15 22:13:37,486 INFO L226 Difference]: Without dead ends: 1334 [2019-11-15 22:13:37,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2343 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2019-11-15 22:13:37,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-11-15 22:13:37,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1084. [2019-11-15 22:13:37,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2019-11-15 22:13:37,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1231 transitions. [2019-11-15 22:13:37,566 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1231 transitions. Word has length 109 [2019-11-15 22:13:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:37,566 INFO L462 AbstractCegarLoop]: Abstraction has 1084 states and 1231 transitions. [2019-11-15 22:13:37,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-11-15 22:13:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1231 transitions. [2019-11-15 22:13:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-15 22:13:37,567 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:37,567 INFO L380 BasicCegarLoop]: trace histogram [30, 30, 29, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:37,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:37,768 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:37,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:37,768 INFO L82 PathProgramCache]: Analyzing trace with hash 151341786, now seen corresponding path program 3 times [2019-11-15 22:13:37,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:37,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917365575] [2019-11-15 22:13:37,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:37,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:37,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 0 proven. 1373 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:38,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917365575] [2019-11-15 22:13:38,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805788742] [2019-11-15 22:13:38,622 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:38,763 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-15 22:13:38,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:13:38,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:13:38,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:38,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:13:38,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:13:38,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:13:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 711 proven. 2 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2019-11-15 22:13:38,868 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:38,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 5] total 44 [2019-11-15 22:13:38,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498709442] [2019-11-15 22:13:38,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-15 22:13:38,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:38,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-15 22:13:38,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1561, Unknown=0, NotChecked=0, Total=1892 [2019-11-15 22:13:38,870 INFO L87 Difference]: Start difference. First operand 1084 states and 1231 transitions. Second operand 44 states. [2019-11-15 22:13:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:49,193 INFO L93 Difference]: Finished difference Result 3004 states and 3457 transitions. [2019-11-15 22:13:49,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2019-11-15 22:13:49,193 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 109 [2019-11-15 22:13:49,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:49,202 INFO L225 Difference]: With dead ends: 3004 [2019-11-15 22:13:49,202 INFO L226 Difference]: Without dead ends: 2924 [2019-11-15 22:13:49,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31325 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=15637, Invalid=64735, Unknown=0, NotChecked=0, Total=80372 [2019-11-15 22:13:49,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2019-11-15 22:13:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1167. [2019-11-15 22:13:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2019-11-15 22:13:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1356 transitions. [2019-11-15 22:13:49,297 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1356 transitions. Word has length 109 [2019-11-15 22:13:49,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:49,298 INFO L462 AbstractCegarLoop]: Abstraction has 1167 states and 1356 transitions. [2019-11-15 22:13:49,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-15 22:13:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1356 transitions. [2019-11-15 22:13:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-15 22:13:49,299 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:49,299 INFO L380 BasicCegarLoop]: trace histogram [30, 30, 30, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:49,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:49,502 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:49,502 INFO L82 PathProgramCache]: Analyzing trace with hash -498019554, now seen corresponding path program 1 times [2019-11-15 22:13:49,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:49,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422812020] [2019-11-15 22:13:49,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:49,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:49,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 0 proven. 1373 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:50,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422812020] [2019-11-15 22:13:50,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153298927] [2019-11-15 22:13:50,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:50,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 22:13:50,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 707 proven. 330 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-11-15 22:13:50,869 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:50,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 18] total 57 [2019-11-15 22:13:50,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070412631] [2019-11-15 22:13:50,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-11-15 22:13:50,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:50,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-11-15 22:13:50,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=2814, Unknown=0, NotChecked=0, Total=3306 [2019-11-15 22:13:50,870 INFO L87 Difference]: Start difference. First operand 1167 states and 1356 transitions. Second operand 58 states. [2019-11-15 22:13:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:53,208 INFO L93 Difference]: Finished difference Result 2211 states and 2563 transitions. [2019-11-15 22:13:53,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-11-15 22:13:53,208 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 109 [2019-11-15 22:13:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:53,212 INFO L225 Difference]: With dead ends: 2211 [2019-11-15 22:13:53,212 INFO L226 Difference]: Without dead ends: 1314 [2019-11-15 22:13:53,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2288 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2172, Invalid=9818, Unknown=0, NotChecked=0, Total=11990 [2019-11-15 22:13:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-15 22:13:53,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1173. [2019-11-15 22:13:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2019-11-15 22:13:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1363 transitions. [2019-11-15 22:13:53,303 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1363 transitions. Word has length 109 [2019-11-15 22:13:53,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:53,303 INFO L462 AbstractCegarLoop]: Abstraction has 1173 states and 1363 transitions. [2019-11-15 22:13:53,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-11-15 22:13:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1363 transitions. [2019-11-15 22:13:53,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-15 22:13:53,304 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:53,304 INFO L380 BasicCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:53,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:53,507 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:53,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:53,508 INFO L82 PathProgramCache]: Analyzing trace with hash -340295162, now seen corresponding path program 2 times [2019-11-15 22:13:53,508 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:53,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993689294] [2019-11-15 22:13:53,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:53,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:53,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:54,218 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993689294] [2019-11-15 22:13:54,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751114733] [2019-11-15 22:13:54,219 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:54,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:13:54,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:13:54,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 22:13:54,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 802 proven. 376 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-11-15 22:13:54,940 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:54,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 19] total 60 [2019-11-15 22:13:54,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264498330] [2019-11-15 22:13:54,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-11-15 22:13:54,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:54,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-11-15 22:13:54,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=3113, Unknown=0, NotChecked=0, Total=3660 [2019-11-15 22:13:54,941 INFO L87 Difference]: Start difference. First operand 1173 states and 1363 transitions. Second operand 61 states. [2019-11-15 22:13:57,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:57,524 INFO L93 Difference]: Finished difference Result 2346 states and 2748 transitions. [2019-11-15 22:13:57,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-11-15 22:13:57,524 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 115 [2019-11-15 22:13:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:57,529 INFO L225 Difference]: With dead ends: 2346 [2019-11-15 22:13:57,529 INFO L226 Difference]: Without dead ends: 1339 [2019-11-15 22:13:57,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2558 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2417, Invalid=10923, Unknown=0, NotChecked=0, Total=13340 [2019-11-15 22:13:57,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-11-15 22:13:57,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1261. [2019-11-15 22:13:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1261 states. [2019-11-15 22:13:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1458 transitions. [2019-11-15 22:13:57,632 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1458 transitions. Word has length 115 [2019-11-15 22:13:57,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:57,632 INFO L462 AbstractCegarLoop]: Abstraction has 1261 states and 1458 transitions. [2019-11-15 22:13:57,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-11-15 22:13:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1458 transitions. [2019-11-15 22:13:57,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 22:13:57,633 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:57,633 INFO L380 BasicCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:57,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:57,834 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:57,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:57,834 INFO L82 PathProgramCache]: Analyzing trace with hash -661992994, now seen corresponding path program 3 times [2019-11-15 22:13:57,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:57,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468192707] [2019-11-15 22:13:57,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:57,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:57,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1759 backedges. 0 proven. 1759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:58,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468192707] [2019-11-15 22:13:58,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304514391] [2019-11-15 22:13:58,863 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:59,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-15 22:13:59,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:13:59,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:13:59,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1759 backedges. 2 proven. 907 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2019-11-15 22:13:59,133 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:59,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 5] total 48 [2019-11-15 22:13:59,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239045457] [2019-11-15 22:13:59,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-11-15 22:13:59,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:59,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-11-15 22:13:59,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=1941, Unknown=0, NotChecked=0, Total=2352 [2019-11-15 22:13:59,135 INFO L87 Difference]: Start difference. First operand 1261 states and 1458 transitions. Second operand 49 states. [2019-11-15 22:14:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:16,389 INFO L93 Difference]: Finished difference Result 4116 states and 4730 transitions. [2019-11-15 22:14:16,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 336 states. [2019-11-15 22:14:16,390 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 121 [2019-11-15 22:14:16,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:16,397 INFO L225 Difference]: With dead ends: 4116 [2019-11-15 22:14:16,398 INFO L226 Difference]: Without dead ends: 4055 [2019-11-15 22:14:16,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61043 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=29831, Invalid=113431, Unknown=0, NotChecked=0, Total=143262 [2019-11-15 22:14:16,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4055 states. [2019-11-15 22:14:16,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4055 to 2287. [2019-11-15 22:14:16,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2287 states. [2019-11-15 22:14:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 2663 transitions. [2019-11-15 22:14:16,570 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 2663 transitions. Word has length 121 [2019-11-15 22:14:16,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:16,571 INFO L462 AbstractCegarLoop]: Abstraction has 2287 states and 2663 transitions. [2019-11-15 22:14:16,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-11-15 22:14:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2663 transitions. [2019-11-15 22:14:16,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-15 22:14:16,573 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:16,573 INFO L380 BasicCegarLoop]: trace histogram [51, 51, 48, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-11-15 22:14:16,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:16,774 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:16,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:16,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2038057369, now seen corresponding path program 4 times [2019-11-15 22:14:16,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:16,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98768534] [2019-11-15 22:14:16,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:16,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:16,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4002 backedges. 49 proven. 3948 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 22:14:17,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98768534] [2019-11-15 22:14:17,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464437379] [2019-11-15 22:14:17,931 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:18,140 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:14:18,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:14:18,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-15 22:14:18,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:18,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:14:19,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:14:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4002 backedges. 1399 proven. 2177 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-11-15 22:14:20,030 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:14:20,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 42] total 98 [2019-11-15 22:14:20,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812095390] [2019-11-15 22:14:20,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-11-15 22:14:20,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:20,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-11-15 22:14:20,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1029, Invalid=8477, Unknown=0, NotChecked=0, Total=9506 [2019-11-15 22:14:20,034 INFO L87 Difference]: Start difference. First operand 2287 states and 2663 transitions. Second operand 98 states. [2019-11-15 22:14:30,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:30,018 INFO L93 Difference]: Finished difference Result 3589 states and 4092 transitions. [2019-11-15 22:14:30,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-11-15 22:14:30,019 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 180 [2019-11-15 22:14:30,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:30,022 INFO L225 Difference]: With dead ends: 3589 [2019-11-15 22:14:30,022 INFO L226 Difference]: Without dead ends: 1919 [2019-11-15 22:14:30,027 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20549 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=7831, Invalid=61075, Unknown=0, NotChecked=0, Total=68906 [2019-11-15 22:14:30,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2019-11-15 22:14:30,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1418. [2019-11-15 22:14:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-11-15 22:14:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1625 transitions. [2019-11-15 22:14:30,182 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1625 transitions. Word has length 180 [2019-11-15 22:14:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:30,183 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 1625 transitions. [2019-11-15 22:14:30,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-11-15 22:14:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1625 transitions. [2019-11-15 22:14:30,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-15 22:14:30,184 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:30,185 INFO L380 BasicCegarLoop]: trace histogram [54, 54, 51, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-11-15 22:14:30,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:30,385 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:30,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:30,385 INFO L82 PathProgramCache]: Analyzing trace with hash -507321356, now seen corresponding path program 5 times [2019-11-15 22:14:30,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:30,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314018900] [2019-11-15 22:14:30,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:30,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:30,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4479 backedges. 39 proven. 4435 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 22:14:32,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314018900] [2019-11-15 22:14:32,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306026329] [2019-11-15 22:14:32,127 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:14:32,385 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2019-11-15 22:14:32,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:14:32,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 22:14:32,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4479 backedges. 2020 proven. 477 refuted. 0 times theorem prover too weak. 1982 trivial. 0 not checked. [2019-11-15 22:14:33,058 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:14:33,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 21] total 79 [2019-11-15 22:14:33,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740195935] [2019-11-15 22:14:33,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-11-15 22:14:33,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:33,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-11-15 22:14:33,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=963, Invalid=5357, Unknown=0, NotChecked=0, Total=6320 [2019-11-15 22:14:33,060 INFO L87 Difference]: Start difference. First operand 1418 states and 1625 transitions. Second operand 80 states. [2019-11-15 22:14:36,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:36,894 INFO L93 Difference]: Finished difference Result 3302 states and 3743 transitions. [2019-11-15 22:14:36,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-11-15 22:14:36,895 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 189 [2019-11-15 22:14:36,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:36,898 INFO L225 Difference]: With dead ends: 3302 [2019-11-15 22:14:36,898 INFO L226 Difference]: Without dead ends: 2091 [2019-11-15 22:14:36,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6387 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5500, Invalid=18680, Unknown=0, NotChecked=0, Total=24180 [2019-11-15 22:14:36,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-11-15 22:14:37,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1514. [2019-11-15 22:14:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1514 states. [2019-11-15 22:14:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1730 transitions. [2019-11-15 22:14:37,096 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1730 transitions. Word has length 189 [2019-11-15 22:14:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:37,097 INFO L462 AbstractCegarLoop]: Abstraction has 1514 states and 1730 transitions. [2019-11-15 22:14:37,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-11-15 22:14:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1730 transitions. [2019-11-15 22:14:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-15 22:14:37,098 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:37,099 INFO L380 BasicCegarLoop]: trace histogram [57, 57, 54, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-11-15 22:14:37,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:37,299 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:37,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:37,299 INFO L82 PathProgramCache]: Analyzing trace with hash -749482745, now seen corresponding path program 6 times [2019-11-15 22:14:37,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:37,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298856687] [2019-11-15 22:14:37,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:37,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:37,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4983 backedges. 29 proven. 4949 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 22:14:38,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298856687] [2019-11-15 22:14:38,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850745114] [2019-11-15 22:14:38,747 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:14:38,962 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-15 22:14:38,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:14:38,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 22:14:38,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:39,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:14:39,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:14:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4983 backedges. 2313 proven. 1 refuted. 0 times theorem prover too weak. 2669 trivial. 0 not checked. [2019-11-15 22:14:39,315 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:14:39,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 8] total 70 [2019-11-15 22:14:39,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780371629] [2019-11-15 22:14:39,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-11-15 22:14:39,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:39,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-11-15 22:14:39,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=4136, Unknown=0, NotChecked=0, Total=4830 [2019-11-15 22:14:39,317 INFO L87 Difference]: Start difference. First operand 1514 states and 1730 transitions. Second operand 70 states. [2019-11-15 22:14:57,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:57,829 INFO L93 Difference]: Finished difference Result 3046 states and 3308 transitions. [2019-11-15 22:14:57,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 283 states. [2019-11-15 22:14:57,830 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 198 [2019-11-15 22:14:57,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:57,831 INFO L225 Difference]: With dead ends: 3046 [2019-11-15 22:14:57,831 INFO L226 Difference]: Without dead ends: 624 [2019-11-15 22:14:57,837 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42908 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=28766, Invalid=94084, Unknown=0, NotChecked=0, Total=122850 [2019-11-15 22:14:57,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-11-15 22:14:57,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 295. [2019-11-15 22:14:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-15 22:14:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 310 transitions. [2019-11-15 22:14:57,861 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 310 transitions. Word has length 198 [2019-11-15 22:14:57,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:57,861 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 310 transitions. [2019-11-15 22:14:57,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-11-15 22:14:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 310 transitions. [2019-11-15 22:14:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-15 22:14:57,862 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:57,862 INFO L380 BasicCegarLoop]: trace histogram [57, 57, 57, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 22:14:58,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:58,063 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:58,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:58,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1624907463, now seen corresponding path program 4 times [2019-11-15 22:14:58,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:58,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111410098] [2019-11-15 22:14:58,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:58,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:58,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:58,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4983 backedges. 4 proven. 3915 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2019-11-15 22:14:58,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111410098] [2019-11-15 22:14:58,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104573094] [2019-11-15 22:14:58,486 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:14:58,729 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:14:58,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:14:58,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 22:14:58,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4983 backedges. 2246 proven. 532 refuted. 0 times theorem prover too weak. 2205 trivial. 0 not checked. [2019-11-15 22:14:59,280 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:14:59,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 47 [2019-11-15 22:14:59,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959520282] [2019-11-15 22:14:59,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-11-15 22:14:59,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:59,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-11-15 22:14:59,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=1757, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 22:14:59,281 INFO L87 Difference]: Start difference. First operand 295 states and 310 transitions. Second operand 48 states. [2019-11-15 22:15:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:01,690 INFO L93 Difference]: Finished difference Result 688 states and 730 transitions. [2019-11-15 22:15:01,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-11-15 22:15:01,690 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 198 [2019-11-15 22:15:01,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:01,691 INFO L225 Difference]: With dead ends: 688 [2019-11-15 22:15:01,691 INFO L226 Difference]: Without dead ends: 395 [2019-11-15 22:15:01,692 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2513 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3390, Invalid=9042, Unknown=0, NotChecked=0, Total=12432 [2019-11-15 22:15:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-11-15 22:15:01,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 313. [2019-11-15 22:15:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-11-15 22:15:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 330 transitions. [2019-11-15 22:15:01,716 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 330 transitions. Word has length 198 [2019-11-15 22:15:01,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:01,716 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 330 transitions. [2019-11-15 22:15:01,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-11-15 22:15:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 330 transitions. [2019-11-15 22:15:01,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-15 22:15:01,717 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:01,717 INFO L380 BasicCegarLoop]: trace histogram [60, 60, 60, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 22:15:01,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:01,917 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:01,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:01,918 INFO L82 PathProgramCache]: Analyzing trace with hash -723137398, now seen corresponding path program 5 times [2019-11-15 22:15:01,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:01,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143645310] [2019-11-15 22:15:01,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:01,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:01,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:02,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 4 proven. 3740 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-11-15 22:15:02,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143645310] [2019-11-15 22:15:02,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450400671] [2019-11-15 22:15:02,043 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:15:02,344 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-11-15 22:15:02,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:15:02,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 22:15:02,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 574 proven. 3760 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2019-11-15 22:15:02,813 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:02,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 28] total 33 [2019-11-15 22:15:02,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952590373] [2019-11-15 22:15:02,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 22:15:02,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:02,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 22:15:02,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=726, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 22:15:02,814 INFO L87 Difference]: Start difference. First operand 313 states and 330 transitions. Second operand 33 states. [2019-11-15 22:15:03,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:03,192 INFO L93 Difference]: Finished difference Result 521 states and 543 transitions. [2019-11-15 22:15:03,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 22:15:03,192 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 207 [2019-11-15 22:15:03,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:03,193 INFO L225 Difference]: With dead ends: 521 [2019-11-15 22:15:03,193 INFO L226 Difference]: Without dead ends: 449 [2019-11-15 22:15:03,194 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=1766, Unknown=0, NotChecked=0, Total=2756 [2019-11-15 22:15:03,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-11-15 22:15:03,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 381. [2019-11-15 22:15:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-15 22:15:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 399 transitions. [2019-11-15 22:15:03,240 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 399 transitions. Word has length 207 [2019-11-15 22:15:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:03,241 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 399 transitions. [2019-11-15 22:15:03,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 22:15:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 399 transitions. [2019-11-15 22:15:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-11-15 22:15:03,243 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:03,243 INFO L380 BasicCegarLoop]: trace histogram [80, 80, 80, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2019-11-15 22:15:03,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:03,455 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:03,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:03,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1395962766, now seen corresponding path program 6 times [2019-11-15 22:15:03,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:03,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618080154] [2019-11-15 22:15:03,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:03,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:03,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9848 backedges. 6 proven. 7482 refuted. 0 times theorem prover too weak. 2360 trivial. 0 not checked. [2019-11-15 22:15:03,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618080154] [2019-11-15 22:15:03,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382054625] [2019-11-15 22:15:03,654 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:15:04,012 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 62 check-sat command(s) [2019-11-15 22:15:04,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:15:04,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:15:04,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 9848 backedges. 6 proven. 7482 refuted. 0 times theorem prover too weak. 2360 trivial. 0 not checked. [2019-11-15 22:15:04,181 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:04,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-15 22:15:04,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909036452] [2019-11-15 22:15:04,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:15:04,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:04,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:15:04,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:15:04,183 INFO L87 Difference]: Start difference. First operand 381 states and 399 transitions. Second operand 13 states. [2019-11-15 22:15:04,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:04,297 INFO L93 Difference]: Finished difference Result 588 states and 611 transitions. [2019-11-15 22:15:04,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:15:04,297 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 275 [2019-11-15 22:15:04,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:04,299 INFO L225 Difference]: With dead ends: 588 [2019-11-15 22:15:04,299 INFO L226 Difference]: Without dead ends: 516 [2019-11-15 22:15:04,299 INFO L600 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-11-15 22:15:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-11-15 22:15:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 449. [2019-11-15 22:15:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-15 22:15:04,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 468 transitions. [2019-11-15 22:15:04,353 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 468 transitions. Word has length 275 [2019-11-15 22:15:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:04,353 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 468 transitions. [2019-11-15 22:15:04,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:15:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 468 transitions. [2019-11-15 22:15:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-11-15 22:15:04,355 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:04,356 INFO L380 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2019-11-15 22:15:04,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:04,568 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:04,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:04,568 INFO L82 PathProgramCache]: Analyzing trace with hash -398042990, now seen corresponding path program 7 times [2019-11-15 22:15:04,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:04,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505048186] [2019-11-15 22:15:04,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:04,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:04,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15430 backedges. 8 proven. 12472 refuted. 0 times theorem prover too weak. 2950 trivial. 0 not checked. [2019-11-15 22:15:04,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505048186] [2019-11-15 22:15:04,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965080550] [2019-11-15 22:15:04,903 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:15:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:05,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:15:05,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15430 backedges. 8 proven. 12472 refuted. 0 times theorem prover too weak. 2950 trivial. 0 not checked. [2019-11-15 22:15:05,530 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:05,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-15 22:15:05,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711469777] [2019-11-15 22:15:05,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 22:15:05,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:05,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:15:05,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:15:05,532 INFO L87 Difference]: Start difference. First operand 449 states and 468 transitions. Second operand 15 states. [2019-11-15 22:15:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:05,656 INFO L93 Difference]: Finished difference Result 656 states and 680 transitions. [2019-11-15 22:15:05,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:15:05,656 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 343 [2019-11-15 22:15:05,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:05,657 INFO L225 Difference]: With dead ends: 656 [2019-11-15 22:15:05,657 INFO L226 Difference]: Without dead ends: 584 [2019-11-15 22:15:05,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:15:05,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-11-15 22:15:05,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 517. [2019-11-15 22:15:05,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-11-15 22:15:05,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 537 transitions. [2019-11-15 22:15:05,698 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 537 transitions. Word has length 343 [2019-11-15 22:15:05,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:05,699 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 537 transitions. [2019-11-15 22:15:05,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 22:15:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 537 transitions. [2019-11-15 22:15:05,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-11-15 22:15:05,701 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:05,701 INFO L380 BasicCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1] [2019-11-15 22:15:05,905 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:05,906 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:05,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:05,906 INFO L82 PathProgramCache]: Analyzing trace with hash -610550890, now seen corresponding path program 8 times [2019-11-15 22:15:05,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:05,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963294500] [2019-11-15 22:15:05,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:05,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:05,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 10 proven. 18710 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2019-11-15 22:15:06,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963294500] [2019-11-15 22:15:06,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246491436] [2019-11-15 22:15:06,271 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:15:06,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:15:06,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:15:06,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 22:15:06,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 10 proven. 18710 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2019-11-15 22:15:06,992 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:06,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-15 22:15:06,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348707998] [2019-11-15 22:15:06,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 22:15:06,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:06,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 22:15:06,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:15:06,993 INFO L87 Difference]: Start difference. First operand 517 states and 537 transitions. Second operand 17 states. [2019-11-15 22:15:07,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:07,100 INFO L93 Difference]: Finished difference Result 724 states and 749 transitions. [2019-11-15 22:15:07,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:15:07,101 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 411 [2019-11-15 22:15:07,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:07,105 INFO L225 Difference]: With dead ends: 724 [2019-11-15 22:15:07,106 INFO L226 Difference]: Without dead ends: 652 [2019-11-15 22:15:07,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:15:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-11-15 22:15:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 585. [2019-11-15 22:15:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-11-15 22:15:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 606 transitions. [2019-11-15 22:15:07,179 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 606 transitions. Word has length 411 [2019-11-15 22:15:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:07,179 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 606 transitions. [2019-11-15 22:15:07,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 22:15:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 606 transitions. [2019-11-15 22:15:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-11-15 22:15:07,182 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:07,183 INFO L380 BasicCegarLoop]: trace histogram [140, 140, 140, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1] [2019-11-15 22:15:07,386 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:07,387 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:07,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:07,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1144380570, now seen corresponding path program 9 times [2019-11-15 22:15:07,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:07,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217280522] [2019-11-15 22:15:07,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:07,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:07,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 30338 backedges. 12 proven. 26196 refuted. 0 times theorem prover too weak. 4130 trivial. 0 not checked. [2019-11-15 22:15:07,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217280522] [2019-11-15 22:15:07,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740305175] [2019-11-15 22:15:07,893 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:15:08,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-11-15 22:15:08,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:15:08,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:15:08,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 30338 backedges. 12 proven. 26196 refuted. 0 times theorem prover too weak. 4130 trivial. 0 not checked. [2019-11-15 22:15:08,788 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:08,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-15 22:15:08,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251151573] [2019-11-15 22:15:08,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 22:15:08,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:08,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 22:15:08,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-11-15 22:15:08,790 INFO L87 Difference]: Start difference. First operand 585 states and 606 transitions. Second operand 19 states. [2019-11-15 22:15:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:08,912 INFO L93 Difference]: Finished difference Result 792 states and 818 transitions. [2019-11-15 22:15:08,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:15:08,913 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 479 [2019-11-15 22:15:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:08,914 INFO L225 Difference]: With dead ends: 792 [2019-11-15 22:15:08,914 INFO L226 Difference]: Without dead ends: 720 [2019-11-15 22:15:08,915 INFO L600 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-11-15 22:15:08,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-11-15 22:15:08,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 653. [2019-11-15 22:15:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-11-15 22:15:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 675 transitions. [2019-11-15 22:15:08,967 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 675 transitions. Word has length 479 [2019-11-15 22:15:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:08,968 INFO L462 AbstractCegarLoop]: Abstraction has 653 states and 675 transitions. [2019-11-15 22:15:08,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 22:15:08,968 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 675 transitions. [2019-11-15 22:15:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2019-11-15 22:15:08,970 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:08,970 INFO L380 BasicCegarLoop]: trace histogram [160, 160, 160, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1] [2019-11-15 22:15:09,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:09,171 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:09,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:09,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1217772446, now seen corresponding path program 10 times [2019-11-15 22:15:09,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:09,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121292293] [2019-11-15 22:15:09,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:09,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:09,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:09,791 INFO L134 CoverageAnalysis]: Checked inductivity of 39664 backedges. 14 proven. 34930 refuted. 0 times theorem prover too weak. 4720 trivial. 0 not checked. [2019-11-15 22:15:09,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121292293] [2019-11-15 22:15:09,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240271425] [2019-11-15 22:15:09,792 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:15:10,138 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:15:10,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:15:10,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-15 22:15:10,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 39664 backedges. 584 proven. 34950 refuted. 0 times theorem prover too weak. 4130 trivial. 0 not checked. [2019-11-15 22:15:11,390 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:11,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 33] total 43 [2019-11-15 22:15:11,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470497500] [2019-11-15 22:15:11,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-15 22:15:11,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:11,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-15 22:15:11,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=1346, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 22:15:11,392 INFO L87 Difference]: Start difference. First operand 653 states and 675 transitions. Second operand 43 states. [2019-11-15 22:15:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:11,830 INFO L93 Difference]: Finished difference Result 861 states and 888 transitions. [2019-11-15 22:15:11,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 22:15:11,830 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 547 [2019-11-15 22:15:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:11,831 INFO L225 Difference]: With dead ends: 861 [2019-11-15 22:15:11,831 INFO L226 Difference]: Without dead ends: 789 [2019-11-15 22:15:11,832 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1320, Invalid=2586, Unknown=0, NotChecked=0, Total=3906 [2019-11-15 22:15:11,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-11-15 22:15:11,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 721. [2019-11-15 22:15:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-11-15 22:15:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 744 transitions. [2019-11-15 22:15:11,924 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 744 transitions. Word has length 547 [2019-11-15 22:15:11,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:11,924 INFO L462 AbstractCegarLoop]: Abstraction has 721 states and 744 transitions. [2019-11-15 22:15:11,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-15 22:15:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 744 transitions. [2019-11-15 22:15:11,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2019-11-15 22:15:11,928 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:11,929 INFO L380 BasicCegarLoop]: trace histogram [180, 180, 180, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1] [2019-11-15 22:15:12,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:12,133 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:12,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:12,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1589401762, now seen corresponding path program 11 times [2019-11-15 22:15:12,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:12,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799541859] [2019-11-15 22:15:12,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:12,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:12,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 50238 backedges. 16 proven. 44912 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2019-11-15 22:15:12,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799541859] [2019-11-15 22:15:12,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195121713] [2019-11-15 22:15:12,906 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:15:13,464 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 88 check-sat command(s) [2019-11-15 22:15:13,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:15:13,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 946 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-15 22:15:13,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 50238 backedges. 586 proven. 44932 refuted. 0 times theorem prover too weak. 4720 trivial. 0 not checked. [2019-11-15 22:15:14,718 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:14,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 34] total 45 [2019-11-15 22:15:14,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560090790] [2019-11-15 22:15:14,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-15 22:15:14,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:14,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-15 22:15:14,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=1506, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 22:15:14,720 INFO L87 Difference]: Start difference. First operand 721 states and 744 transitions. Second operand 45 states. [2019-11-15 22:15:15,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:15,636 INFO L93 Difference]: Finished difference Result 929 states and 957 transitions. [2019-11-15 22:15:15,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-11-15 22:15:15,636 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 615 [2019-11-15 22:15:15,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:15,637 INFO L225 Difference]: With dead ends: 929 [2019-11-15 22:15:15,637 INFO L226 Difference]: Without dead ends: 857 [2019-11-15 22:15:15,638 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1615 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2509, Invalid=4801, Unknown=0, NotChecked=0, Total=7310 [2019-11-15 22:15:15,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-11-15 22:15:15,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 789. [2019-11-15 22:15:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-11-15 22:15:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 813 transitions. [2019-11-15 22:15:15,739 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 813 transitions. Word has length 615 [2019-11-15 22:15:15,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:15,739 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 813 transitions. [2019-11-15 22:15:15,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-15 22:15:15,739 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 813 transitions. [2019-11-15 22:15:15,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-11-15 22:15:15,742 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:15,743 INFO L380 BasicCegarLoop]: trace histogram [200, 200, 200, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1] [2019-11-15 22:15:15,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:15,947 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:15,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:15,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1943358554, now seen corresponding path program 12 times [2019-11-15 22:15:15,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:15,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812271594] [2019-11-15 22:15:15,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:15,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:15,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 62060 backedges. 18 proven. 56142 refuted. 0 times theorem prover too weak. 5900 trivial. 0 not checked. [2019-11-15 22:15:16,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812271594] [2019-11-15 22:15:16,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970607238] [2019-11-15 22:15:16,728 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:15:17,237 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 65 check-sat command(s) [2019-11-15 22:15:17,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:15:17,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:15:17,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 62060 backedges. 18 proven. 56142 refuted. 0 times theorem prover too weak. 5900 trivial. 0 not checked. [2019-11-15 22:15:18,200 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:18,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-11-15 22:15:18,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963104002] [2019-11-15 22:15:18,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 22:15:18,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:18,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 22:15:18,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:15:18,202 INFO L87 Difference]: Start difference. First operand 789 states and 813 transitions. Second operand 25 states. [2019-11-15 22:15:18,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:18,349 INFO L93 Difference]: Finished difference Result 996 states and 1025 transitions. [2019-11-15 22:15:18,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:15:18,350 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 683 [2019-11-15 22:15:18,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:18,351 INFO L225 Difference]: With dead ends: 996 [2019-11-15 22:15:18,351 INFO L226 Difference]: Without dead ends: 924 [2019-11-15 22:15:18,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 672 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:15:18,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-11-15 22:15:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 857. [2019-11-15 22:15:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-11-15 22:15:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 882 transitions. [2019-11-15 22:15:18,425 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 882 transitions. Word has length 683 [2019-11-15 22:15:18,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:18,426 INFO L462 AbstractCegarLoop]: Abstraction has 857 states and 882 transitions. [2019-11-15 22:15:18,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 22:15:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 882 transitions. [2019-11-15 22:15:18,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2019-11-15 22:15:18,429 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:18,430 INFO L380 BasicCegarLoop]: trace histogram [220, 220, 220, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1] [2019-11-15 22:15:18,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:18,633 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:18,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:18,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1511928662, now seen corresponding path program 13 times [2019-11-15 22:15:18,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:18,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661844329] [2019-11-15 22:15:18,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:18,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:18,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 75130 backedges. 20 proven. 68620 refuted. 0 times theorem prover too weak. 6490 trivial. 0 not checked. [2019-11-15 22:15:19,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661844329] [2019-11-15 22:15:19,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423146485] [2019-11-15 22:15:19,535 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:15:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:19,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 1150 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:15:19,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 75130 backedges. 20 proven. 68620 refuted. 0 times theorem prover too weak. 6490 trivial. 0 not checked. [2019-11-15 22:15:21,126 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:21,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-11-15 22:15:21,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261273708] [2019-11-15 22:15:21,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 22:15:21,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:21,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 22:15:21,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-11-15 22:15:21,127 INFO L87 Difference]: Start difference. First operand 857 states and 882 transitions. Second operand 27 states. [2019-11-15 22:15:21,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:21,300 INFO L93 Difference]: Finished difference Result 1064 states and 1094 transitions. [2019-11-15 22:15:21,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 22:15:21,301 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 751 [2019-11-15 22:15:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:21,304 INFO L225 Difference]: With dead ends: 1064 [2019-11-15 22:15:21,304 INFO L226 Difference]: Without dead ends: 992 [2019-11-15 22:15:21,304 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 739 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-11-15 22:15:21,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-11-15 22:15:21,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 925. [2019-11-15 22:15:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2019-11-15 22:15:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 951 transitions. [2019-11-15 22:15:21,428 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 951 transitions. Word has length 751 [2019-11-15 22:15:21,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:21,428 INFO L462 AbstractCegarLoop]: Abstraction has 925 states and 951 transitions. [2019-11-15 22:15:21,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 22:15:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 951 transitions. [2019-11-15 22:15:21,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2019-11-15 22:15:21,434 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:21,434 INFO L380 BasicCegarLoop]: trace histogram [240, 240, 240, 12, 12, 12, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1] [2019-11-15 22:15:21,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:21,639 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:21,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:21,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1872583762, now seen corresponding path program 14 times [2019-11-15 22:15:21,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:21,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169836366] [2019-11-15 22:15:21,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:21,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:21,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 89448 backedges. 22 proven. 82346 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-11-15 22:15:22,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169836366] [2019-11-15 22:15:22,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702556313] [2019-11-15 22:15:22,709 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:15:23,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:15:23,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:15:23,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 22:15:23,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 89448 backedges. 22 proven. 82346 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-11-15 22:15:24,249 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:24,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2019-11-15 22:15:24,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129574201] [2019-11-15 22:15:24,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 22:15:24,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:24,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 22:15:24,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2019-11-15 22:15:24,250 INFO L87 Difference]: Start difference. First operand 925 states and 951 transitions. Second operand 29 states. [2019-11-15 22:15:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:24,428 INFO L93 Difference]: Finished difference Result 1132 states and 1163 transitions. [2019-11-15 22:15:24,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:15:24,428 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 819 [2019-11-15 22:15:24,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:24,429 INFO L225 Difference]: With dead ends: 1132 [2019-11-15 22:15:24,429 INFO L226 Difference]: Without dead ends: 1060 [2019-11-15 22:15:24,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 806 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2019-11-15 22:15:24,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-11-15 22:15:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 993. [2019-11-15 22:15:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-11-15 22:15:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1020 transitions. [2019-11-15 22:15:24,516 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1020 transitions. Word has length 819 [2019-11-15 22:15:24,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:24,516 INFO L462 AbstractCegarLoop]: Abstraction has 993 states and 1020 transitions. [2019-11-15 22:15:24,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 22:15:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1020 transitions. [2019-11-15 22:15:24,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2019-11-15 22:15:24,521 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:24,521 INFO L380 BasicCegarLoop]: trace histogram [260, 260, 260, 13, 13, 13, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1] [2019-11-15 22:15:24,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:24,722 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:24,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:24,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2142124210, now seen corresponding path program 15 times [2019-11-15 22:15:24,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:24,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662616443] [2019-11-15 22:15:24,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:24,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:24,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:26,197 INFO L134 CoverageAnalysis]: Checked inductivity of 105014 backedges. 24 proven. 97320 refuted. 0 times theorem prover too weak. 7670 trivial. 0 not checked. [2019-11-15 22:15:26,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662616443] [2019-11-15 22:15:26,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040547464] [2019-11-15 22:15:26,198 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:15:26,909 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 131 check-sat command(s) [2019-11-15 22:15:26,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:15:26,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 22:15:26,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 105014 backedges. 24 proven. 97320 refuted. 0 times theorem prover too weak. 7670 trivial. 0 not checked. [2019-11-15 22:15:28,245 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:28,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-11-15 22:15:28,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036289904] [2019-11-15 22:15:28,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 22:15:28,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:28,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 22:15:28,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-11-15 22:15:28,247 INFO L87 Difference]: Start difference. First operand 993 states and 1020 transitions. Second operand 31 states. [2019-11-15 22:15:28,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:28,434 INFO L93 Difference]: Finished difference Result 1200 states and 1232 transitions. [2019-11-15 22:15:28,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:15:28,434 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 887 [2019-11-15 22:15:28,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:28,435 INFO L225 Difference]: With dead ends: 1200 [2019-11-15 22:15:28,435 INFO L226 Difference]: Without dead ends: 1128 [2019-11-15 22:15:28,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-11-15 22:15:28,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-11-15 22:15:28,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1061. [2019-11-15 22:15:28,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2019-11-15 22:15:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1089 transitions. [2019-11-15 22:15:28,528 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1089 transitions. Word has length 887 [2019-11-15 22:15:28,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:28,528 INFO L462 AbstractCegarLoop]: Abstraction has 1061 states and 1089 transitions. [2019-11-15 22:15:28,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 22:15:28,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1089 transitions. [2019-11-15 22:15:28,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2019-11-15 22:15:28,534 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:28,534 INFO L380 BasicCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 13, 13, 1, 1, 1, 1, 1] [2019-11-15 22:15:28,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:28,735 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:28,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:28,735 INFO L82 PathProgramCache]: Analyzing trace with hash 927304630, now seen corresponding path program 16 times [2019-11-15 22:15:28,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:28,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109526784] [2019-11-15 22:15:28,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:28,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:28,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 121828 backedges. 26 proven. 113542 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2019-11-15 22:15:30,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109526784] [2019-11-15 22:15:30,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214845412] [2019-11-15 22:15:30,177 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:15:30,588 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:15:30,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:15:30,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-15 22:15:30,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 121828 backedges. 596 proven. 113562 refuted. 0 times theorem prover too weak. 7670 trivial. 0 not checked. [2019-11-15 22:15:32,698 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:32,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 39] total 55 [2019-11-15 22:15:32,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755485324] [2019-11-15 22:15:32,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-15 22:15:32,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:32,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-15 22:15:32,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=2255, Unknown=0, NotChecked=0, Total=2970 [2019-11-15 22:15:32,700 INFO L87 Difference]: Start difference. First operand 1061 states and 1089 transitions. Second operand 55 states. [2019-11-15 22:15:33,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:33,236 INFO L93 Difference]: Finished difference Result 1269 states and 1302 transitions. [2019-11-15 22:15:33,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-15 22:15:33,236 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 955 [2019-11-15 22:15:33,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:33,237 INFO L225 Difference]: With dead ends: 1269 [2019-11-15 22:15:33,237 INFO L226 Difference]: Without dead ends: 1197 [2019-11-15 22:15:33,238 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 991 GetRequests, 918 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1815, Invalid=3735, Unknown=0, NotChecked=0, Total=5550 [2019-11-15 22:15:33,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-11-15 22:15:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1129. [2019-11-15 22:15:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2019-11-15 22:15:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1158 transitions. [2019-11-15 22:15:33,394 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1158 transitions. Word has length 955 [2019-11-15 22:15:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:33,395 INFO L462 AbstractCegarLoop]: Abstraction has 1129 states and 1158 transitions. [2019-11-15 22:15:33,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-15 22:15:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1158 transitions. [2019-11-15 22:15:33,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1024 [2019-11-15 22:15:33,403 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:33,404 INFO L380 BasicCegarLoop]: trace histogram [300, 300, 300, 15, 15, 15, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1] [2019-11-15 22:15:33,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:33,614 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:33,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:33,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1244241082, now seen corresponding path program 17 times [2019-11-15 22:15:33,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:33,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288483247] [2019-11-15 22:15:33,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:33,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:33,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 139890 backedges. 28 proven. 131012 refuted. 0 times theorem prover too weak. 8850 trivial. 0 not checked. [2019-11-15 22:15:35,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288483247] [2019-11-15 22:15:35,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061883679] [2019-11-15 22:15:35,110 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:15:36,106 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 153 check-sat command(s) [2019-11-15 22:15:36,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:15:36,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 1558 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-15 22:15:36,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 139890 backedges. 598 proven. 131032 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2019-11-15 22:15:38,307 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:38,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 40] total 57 [2019-11-15 22:15:38,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289948951] [2019-11-15 22:15:38,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-11-15 22:15:38,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:38,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-11-15 22:15:38,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=2487, Unknown=0, NotChecked=0, Total=3192 [2019-11-15 22:15:38,310 INFO L87 Difference]: Start difference. First operand 1129 states and 1158 transitions. Second operand 57 states. [2019-11-15 22:15:39,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:39,720 INFO L93 Difference]: Finished difference Result 1337 states and 1371 transitions. [2019-11-15 22:15:39,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-11-15 22:15:39,721 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 1023 [2019-11-15 22:15:39,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:39,722 INFO L225 Difference]: With dead ends: 1337 [2019-11-15 22:15:39,722 INFO L226 Difference]: Without dead ends: 1265 [2019-11-15 22:15:39,724 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1102 GetRequests, 985 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3647 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4808, Invalid=9234, Unknown=0, NotChecked=0, Total=14042 [2019-11-15 22:15:39,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-11-15 22:15:39,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1197. [2019-11-15 22:15:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-15 22:15:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1227 transitions. [2019-11-15 22:15:39,831 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1227 transitions. Word has length 1023 [2019-11-15 22:15:39,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:39,831 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1227 transitions. [2019-11-15 22:15:39,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-11-15 22:15:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1227 transitions. [2019-11-15 22:15:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1092 [2019-11-15 22:15:39,838 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:39,838 INFO L380 BasicCegarLoop]: trace histogram [320, 320, 320, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1] [2019-11-15 22:15:40,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:40,039 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:40,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:40,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1524329406, now seen corresponding path program 18 times [2019-11-15 22:15:40,039 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:40,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436451429] [2019-11-15 22:15:40,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:40,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:40,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:41,707 INFO L134 CoverageAnalysis]: Checked inductivity of 159200 backedges. 30 proven. 149730 refuted. 0 times theorem prover too weak. 9440 trivial. 0 not checked. [2019-11-15 22:15:41,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436451429] [2019-11-15 22:15:41,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55736173] [2019-11-15 22:15:41,708 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:15:42,393 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 139 check-sat command(s) [2019-11-15 22:15:42,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:15:42,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 1244 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 22:15:42,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 159200 backedges. 30 proven. 149730 refuted. 0 times theorem prover too weak. 9440 trivial. 0 not checked. [2019-11-15 22:15:44,333 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:44,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-11-15 22:15:44,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494596607] [2019-11-15 22:15:44,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-15 22:15:44,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:44,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-15 22:15:44,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 22:15:44,335 INFO L87 Difference]: Start difference. First operand 1197 states and 1227 transitions. Second operand 37 states. [2019-11-15 22:15:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:44,618 INFO L93 Difference]: Finished difference Result 1404 states and 1439 transitions. [2019-11-15 22:15:44,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 22:15:44,618 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1091 [2019-11-15 22:15:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:44,620 INFO L225 Difference]: With dead ends: 1404 [2019-11-15 22:15:44,620 INFO L226 Difference]: Without dead ends: 1332 [2019-11-15 22:15:44,620 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1109 GetRequests, 1074 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 22:15:44,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2019-11-15 22:15:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1265. [2019-11-15 22:15:44,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-11-15 22:15:44,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1296 transitions. [2019-11-15 22:15:44,734 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1296 transitions. Word has length 1091 [2019-11-15 22:15:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:44,734 INFO L462 AbstractCegarLoop]: Abstraction has 1265 states and 1296 transitions. [2019-11-15 22:15:44,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-15 22:15:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1296 transitions. [2019-11-15 22:15:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1160 [2019-11-15 22:15:44,741 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:44,742 INFO L380 BasicCegarLoop]: trace histogram [340, 340, 340, 17, 17, 17, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1] [2019-11-15 22:15:44,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:44,942 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:44,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:44,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1532754114, now seen corresponding path program 19 times [2019-11-15 22:15:44,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:44,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031268421] [2019-11-15 22:15:44,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:44,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:44,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 179758 backedges. 32 proven. 169696 refuted. 0 times theorem prover too weak. 10030 trivial. 0 not checked. [2019-11-15 22:15:46,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031268421] [2019-11-15 22:15:46,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063932708] [2019-11-15 22:15:46,780 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:15:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:47,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 1762 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 22:15:47,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 179758 backedges. 32 proven. 169696 refuted. 0 times theorem prover too weak. 10030 trivial. 0 not checked. [2019-11-15 22:15:49,404 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:49,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2019-11-15 22:15:49,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518365343] [2019-11-15 22:15:49,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-15 22:15:49,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:49,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-15 22:15:49,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 22:15:49,406 INFO L87 Difference]: Start difference. First operand 1265 states and 1296 transitions. Second operand 39 states. [2019-11-15 22:15:49,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:49,654 INFO L93 Difference]: Finished difference Result 1472 states and 1508 transitions. [2019-11-15 22:15:49,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 22:15:49,655 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1159 [2019-11-15 22:15:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:49,656 INFO L225 Difference]: With dead ends: 1472 [2019-11-15 22:15:49,656 INFO L226 Difference]: Without dead ends: 1400 [2019-11-15 22:15:49,656 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1178 GetRequests, 1141 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 22:15:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2019-11-15 22:15:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1333. [2019-11-15 22:15:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-11-15 22:15:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1365 transitions. [2019-11-15 22:15:49,777 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1365 transitions. Word has length 1159 [2019-11-15 22:15:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:49,778 INFO L462 AbstractCegarLoop]: Abstraction has 1333 states and 1365 transitions. [2019-11-15 22:15:49,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-15 22:15:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1365 transitions. [2019-11-15 22:15:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1228 [2019-11-15 22:15:49,786 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:49,786 INFO L380 BasicCegarLoop]: trace histogram [360, 360, 360, 18, 18, 18, 18, 18, 18, 17, 17, 1, 1, 1, 1, 1] [2019-11-15 22:15:49,987 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:49,987 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:49,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:49,987 INFO L82 PathProgramCache]: Analyzing trace with hash -852737082, now seen corresponding path program 20 times [2019-11-15 22:15:49,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:49,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905531390] [2019-11-15 22:15:49,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:49,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:49,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 201564 backedges. 34 proven. 190910 refuted. 0 times theorem prover too weak. 10620 trivial. 0 not checked. [2019-11-15 22:15:52,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905531390] [2019-11-15 22:15:52,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921891272] [2019-11-15 22:15:52,088 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:15:52,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:15:52,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:15:52,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 1864 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 22:15:52,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 201564 backedges. 34 proven. 190910 refuted. 0 times theorem prover too weak. 10620 trivial. 0 not checked. [2019-11-15 22:15:55,074 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:55,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2019-11-15 22:15:55,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741661456] [2019-11-15 22:15:55,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-15 22:15:55,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:55,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-15 22:15:55,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 22:15:55,076 INFO L87 Difference]: Start difference. First operand 1333 states and 1365 transitions. Second operand 41 states. [2019-11-15 22:15:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:55,332 INFO L93 Difference]: Finished difference Result 1540 states and 1577 transitions. [2019-11-15 22:15:55,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 22:15:55,333 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1227 [2019-11-15 22:15:55,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:55,334 INFO L225 Difference]: With dead ends: 1540 [2019-11-15 22:15:55,334 INFO L226 Difference]: Without dead ends: 1468 [2019-11-15 22:15:55,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1247 GetRequests, 1208 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 22:15:55,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2019-11-15 22:15:55,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1401. [2019-11-15 22:15:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-11-15 22:15:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1434 transitions. [2019-11-15 22:15:55,464 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1434 transitions. Word has length 1227 [2019-11-15 22:15:55,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:55,464 INFO L462 AbstractCegarLoop]: Abstraction has 1401 states and 1434 transitions. [2019-11-15 22:15:55,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-15 22:15:55,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1434 transitions. [2019-11-15 22:15:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1296 [2019-11-15 22:15:55,473 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:55,474 INFO L380 BasicCegarLoop]: trace histogram [380, 380, 380, 19, 19, 19, 19, 19, 19, 18, 18, 1, 1, 1, 1, 1] [2019-11-15 22:15:55,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:55,674 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:55,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:55,674 INFO L82 PathProgramCache]: Analyzing trace with hash 21843146, now seen corresponding path program 21 times [2019-11-15 22:15:55,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:55,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350729679] [2019-11-15 22:15:55,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:55,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:55,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 224618 backedges. 36 proven. 213372 refuted. 0 times theorem prover too weak. 11210 trivial. 0 not checked. [2019-11-15 22:15:58,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350729679] [2019-11-15 22:15:58,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407596877] [2019-11-15 22:15:58,005 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/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-11-15 22:15:58,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 137 check-sat command(s) [2019-11-15 22:15:58,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:15:58,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 22:15:58,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:16:01,533 INFO L134 CoverageAnalysis]: Checked inductivity of 224618 backedges. 36 proven. 213372 refuted. 0 times theorem prover too weak. 11210 trivial. 0 not checked. [2019-11-15 22:16:01,534 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:16:01,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2019-11-15 22:16:01,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67421364] [2019-11-15 22:16:01,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-15 22:16:01,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:16:01,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-15 22:16:01,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 22:16:01,536 INFO L87 Difference]: Start difference. First operand 1401 states and 1434 transitions. Second operand 43 states. [2019-11-15 22:16:01,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:16:01,823 INFO L93 Difference]: Finished difference Result 1608 states and 1646 transitions. [2019-11-15 22:16:01,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 22:16:01,823 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 1295 [2019-11-15 22:16:01,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:16:01,824 INFO L225 Difference]: With dead ends: 1608 [2019-11-15 22:16:01,825 INFO L226 Difference]: Without dead ends: 1536 [2019-11-15 22:16:01,825 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1316 GetRequests, 1275 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 22:16:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2019-11-15 22:16:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1469. [2019-11-15 22:16:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2019-11-15 22:16:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 1503 transitions. [2019-11-15 22:16:01,962 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 1503 transitions. Word has length 1295 [2019-11-15 22:16:01,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:16:01,963 INFO L462 AbstractCegarLoop]: Abstraction has 1469 states and 1503 transitions. [2019-11-15 22:16:01,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-15 22:16:01,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1503 transitions. [2019-11-15 22:16:01,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1364 [2019-11-15 22:16:01,972 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:16:01,973 INFO L380 BasicCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1] [2019-11-15 22:16:02,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:16:02,173 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:16:02,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:16:02,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1480594382, now seen corresponding path program 22 times [2019-11-15 22:16:02,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:16:02,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801726543] [2019-11-15 22:16:02,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:16:02,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:16:02,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:16:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:16:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:16:02,902 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:16:02,903 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:16:03,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:16:03 BoogieIcfgContainer [2019-11-15 22:16:03,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:16:03,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:16:03,179 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:16:03,179 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:16:03,179 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:12:11" (3/4) ... [2019-11-15 22:16:03,181 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:16:03,480 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f82a5f43-70d5-4516-bd44-db8757e9fb5c/bin/uautomizer/witness.graphml [2019-11-15 22:16:03,481 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:16:03,482 INFO L168 Benchmark]: Toolchain (without parser) took 232568.06 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.5 GB). Free memory was 943.4 MB in the beginning and 1.8 GB in the end (delta: -875.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-15 22:16:03,482 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:16:03,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -207.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:16:03,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:16:03,483 INFO L168 Benchmark]: Boogie Preprocessor took 37.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:16:03,483 INFO L168 Benchmark]: RCFGBuilder took 269.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:16:03,484 INFO L168 Benchmark]: TraceAbstraction took 231615.37 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -761.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-15 22:16:03,484 INFO L168 Benchmark]: Witness Printer took 302.07 ms. Allocated memory is still 3.5 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 70.4 MB). Peak memory consumption was 70.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:16:03,486 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 307.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -207.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 269.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 231615.37 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -761.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 302.07 ms. Allocated memory is still 3.5 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 70.4 MB). Peak memory consumption was 70.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: 231.5s, OverallIterations: 60, TraceHistogramMax: 400, AutomataDifference: 135.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 738 SDtfs, 26081 SDslu, 6085 SDs, 0 SdLazy, 40465 SolverSat, 6902 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19948 GetRequests, 15052 SyntacticMatches, 1 SemanticMatches, 4895 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319645 ImplicationChecksByTransitivity, 134.4s 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.7s AutomataMinimizationTime, 59 MinimizatonAttempts, 15077 StatesRemovedByMinimization, 59 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 52.6s 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...