./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0233d496bfaf5cb1311bfa260a57f41458184795 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 09:46:59,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 09:46:59,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 09:46:59,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 09:46:59,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 09:46:59,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 09:46:59,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 09:46:59,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 09:46:59,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 09:46:59,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 09:46:59,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 09:46:59,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 09:46:59,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 09:46:59,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 09:46:59,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 09:46:59,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 09:46:59,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 09:46:59,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 09:46:59,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 09:46:59,125 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 09:46:59,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 09:46:59,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 09:46:59,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 09:46:59,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 09:46:59,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 09:46:59,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 09:46:59,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 09:46:59,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 09:46:59,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 09:46:59,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 09:46:59,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 09:46:59,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 09:46:59,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 09:46:59,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 09:46:59,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 09:46:59,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 09:46:59,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 09:46:59,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 09:46:59,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 09:46:59,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 09:46:59,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 09:46:59,144 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-20 09:46:59,159 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 09:46:59,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 09:46:59,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 09:46:59,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 09:46:59,161 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 09:46:59,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 09:46:59,162 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 09:46:59,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 09:46:59,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 09:46:59,163 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 09:46:59,163 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 09:46:59,163 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 09:46:59,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 09:46:59,163 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 09:46:59,164 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 09:46:59,164 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 09:46:59,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 09:46:59,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 09:46:59,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 09:46:59,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 09:46:59,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 09:46:59,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 09:46:59,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 09:46:59,166 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 09:46:59,166 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 09:46:59,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 09:46:59,167 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_3c6d2aab-0ffc-40df-b616-415397504c8a/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2019-11-20 09:46:59,343 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 09:46:59,364 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 09:46:59,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 09:46:59,370 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 09:46:59,370 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 09:46:59,371 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-11-20 09:46:59,439 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/data/ff3e8eb94/6dceda99f5d542ae969470a7f76d26a3/FLAGbd636262b [2019-11-20 09:46:59,840 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 09:46:59,840 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-11-20 09:46:59,850 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/data/ff3e8eb94/6dceda99f5d542ae969470a7f76d26a3/FLAGbd636262b [2019-11-20 09:47:00,177 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/data/ff3e8eb94/6dceda99f5d542ae969470a7f76d26a3 [2019-11-20 09:47:00,181 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 09:47:00,182 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 09:47:00,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 09:47:00,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 09:47:00,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 09:47:00,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:47:00" (1/1) ... [2019-11-20 09:47:00,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b68eb28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:00, skipping insertion in model container [2019-11-20 09:47:00,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:47:00" (1/1) ... [2019-11-20 09:47:00,204 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 09:47:00,226 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 09:47:00,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:47:00,476 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 09:47:00,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:47:00,613 INFO L192 MainTranslator]: Completed translation [2019-11-20 09:47:00,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:00 WrapperNode [2019-11-20 09:47:00,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 09:47:00,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 09:47:00,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 09:47:00,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 09:47:00,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:00" (1/1) ... [2019-11-20 09:47:00,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:00" (1/1) ... [2019-11-20 09:47:00,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:00" (1/1) ... [2019-11-20 09:47:00,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:00" (1/1) ... [2019-11-20 09:47:00,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:00" (1/1) ... [2019-11-20 09:47:00,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:00" (1/1) ... [2019-11-20 09:47:00,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:00" (1/1) ... [2019-11-20 09:47:00,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 09:47:00,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 09:47:00,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 09:47:00,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 09:47:00,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 09:47:00,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 09:47:00,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 09:47:00,723 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 09:47:00,723 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 09:47:00,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 09:47:00,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 09:47:00,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 09:47:00,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 09:47:00,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 09:47:00,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 09:47:01,278 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 09:47:01,278 INFO L285 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-20 09:47:01,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:47:01 BoogieIcfgContainer [2019-11-20 09:47:01,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 09:47:01,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 09:47:01,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 09:47:01,285 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 09:47:01,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:47:00" (1/3) ... [2019-11-20 09:47:01,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da638b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:47:01, skipping insertion in model container [2019-11-20 09:47:01,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:47:00" (2/3) ... [2019-11-20 09:47:01,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da638b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:47:01, skipping insertion in model container [2019-11-20 09:47:01,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:47:01" (3/3) ... [2019-11-20 09:47:01,301 INFO L109 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2019-11-20 09:47:01,312 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 09:47:01,321 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-11-20 09:47:01,334 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-11-20 09:47:01,362 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 09:47:01,363 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 09:47:01,363 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 09:47:01,363 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 09:47:01,363 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 09:47:01,364 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 09:47:01,365 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 09:47:01,365 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 09:47:01,394 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2019-11-20 09:47:01,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 09:47:01,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:01,404 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:01,404 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-20 09:47:01,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:01,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1507145205, now seen corresponding path program 1 times [2019-11-20 09:47:01,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:01,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1014689851] [2019-11-20 09:47:01,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:01,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 09:47:01,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:01,765 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 19 [2019-11-20 09:47:01,766 INFO L343 Elim1Store]: treesize reduction 93, result has 20.5 percent of original size [2019-11-20 09:47:01,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 51 [2019-11-20 09:47:01,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:01,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:01,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:01,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:37 [2019-11-20 09:47:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:01,835 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:01,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1014689851] [2019-11-20 09:47:01,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:47:01,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 09:47:01,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322259722] [2019-11-20 09:47:01,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:47:01,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:01,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:47:01,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:47:01,885 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2019-11-20 09:47:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:02,216 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-11-20 09:47:02,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:47:02,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-20 09:47:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:02,230 INFO L225 Difference]: With dead ends: 57 [2019-11-20 09:47:02,231 INFO L226 Difference]: Without dead ends: 54 [2019-11-20 09:47:02,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:47:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-20 09:47:02,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-20 09:47:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-20 09:47:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-20 09:47:02,276 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 7 [2019-11-20 09:47:02,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:02,277 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-20 09:47:02,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:47:02,278 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-20 09:47:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 09:47:02,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:02,279 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:02,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:02,481 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-20 09:47:02,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:02,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1507145206, now seen corresponding path program 1 times [2019-11-20 09:47:02,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:02,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2003858870] [2019-11-20 09:47:02,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:02,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 09:47:02,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:02,598 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_39|], 4=[|v_#valid_54|]} [2019-11-20 09:47:02,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:47:02,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:47:02,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:47:02,682 INFO L343 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2019-11-20 09:47:02,683 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2019-11-20 09:47:02,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:02,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:02,747 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:02,748 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-20 09:47:02,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:02,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:02,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:02,789 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:36 [2019-11-20 09:47:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:02,860 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:02,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2003858870] [2019-11-20 09:47:02,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:47:02,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 09:47:02,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611059470] [2019-11-20 09:47:02,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:47:02,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:02,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:47:02,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:47:02,913 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 4 states. [2019-11-20 09:47:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:03,142 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-11-20 09:47:03,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:47:03,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-20 09:47:03,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:03,145 INFO L225 Difference]: With dead ends: 50 [2019-11-20 09:47:03,145 INFO L226 Difference]: Without dead ends: 50 [2019-11-20 09:47:03,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:47:03,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-20 09:47:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-20 09:47:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-20 09:47:03,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-11-20 09:47:03,157 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 7 [2019-11-20 09:47:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:03,158 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-11-20 09:47:03,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:47:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-11-20 09:47:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 09:47:03,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:03,159 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:03,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:03,370 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-20 09:47:03,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:03,371 INFO L82 PathProgramCache]: Analyzing trace with hash -523138922, now seen corresponding path program 1 times [2019-11-20 09:47:03,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:03,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1250116706] [2019-11-20 09:47:03,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:03,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 09:47:03,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:03,546 INFO L343 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2019-11-20 09:47:03,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 32 [2019-11-20 09:47:03,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:03,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:03,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:03,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:29 [2019-11-20 09:47:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:03,627 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:03,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:03,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1250116706] [2019-11-20 09:47:03,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:47:03,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2019-11-20 09:47:03,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774346420] [2019-11-20 09:47:03,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 09:47:03,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:03,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 09:47:03,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:47:03,667 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2019-11-20 09:47:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:03,804 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-11-20 09:47:03,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:47:03,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-11-20 09:47:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:03,807 INFO L225 Difference]: With dead ends: 46 [2019-11-20 09:47:03,807 INFO L226 Difference]: Without dead ends: 46 [2019-11-20 09:47:03,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:47:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-20 09:47:03,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-11-20 09:47:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-20 09:47:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-11-20 09:47:03,814 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 8 [2019-11-20 09:47:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:03,814 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-11-20 09:47:03,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 09:47:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-11-20 09:47:03,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 09:47:03,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:03,815 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:04,015 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:04,016 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-20 09:47:04,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:04,016 INFO L82 PathProgramCache]: Analyzing trace with hash -523138921, now seen corresponding path program 1 times [2019-11-20 09:47:04,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:04,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [674612587] [2019-11-20 09:47:04,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:04,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 09:47:04,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:04,125 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_42|], 2=[|v_#valid_64|]} [2019-11-20 09:47:04,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:47:04,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:47:04,224 INFO L343 Elim1Store]: treesize reduction 58, result has 21.6 percent of original size [2019-11-20 09:47:04,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2019-11-20 09:47:04,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:04,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:04,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-20 09:47:04,269 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:04,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:04,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:04,300 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:30, output treesize:32 [2019-11-20 09:47:04,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:04,357 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:04,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [674612587] [2019-11-20 09:47:04,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:47:04,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 09:47:04,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678521603] [2019-11-20 09:47:04,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:47:04,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:04,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:47:04,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:47:04,405 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 4 states. [2019-11-20 09:47:04,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:04,521 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-11-20 09:47:04,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:47:04,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-20 09:47:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:04,523 INFO L225 Difference]: With dead ends: 42 [2019-11-20 09:47:04,523 INFO L226 Difference]: Without dead ends: 42 [2019-11-20 09:47:04,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:47:04,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-20 09:47:04,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-20 09:47:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 09:47:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-20 09:47:04,531 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 8 [2019-11-20 09:47:04,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:04,532 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-20 09:47:04,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:47:04,532 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-20 09:47:04,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 09:47:04,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:04,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:04,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:04,735 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-20 09:47:04,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:04,736 INFO L82 PathProgramCache]: Analyzing trace with hash 962562584, now seen corresponding path program 1 times [2019-11-20 09:47:04,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:04,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1664928637] [2019-11-20 09:47:04,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:04,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 09:47:04,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:04,922 INFO L343 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2019-11-20 09:47:04,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 36 [2019-11-20 09:47:04,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:04,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:04,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:04,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:33 [2019-11-20 09:47:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:04,988 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:05,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:05,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1664928637] [2019-11-20 09:47:05,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:47:05,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2019-11-20 09:47:05,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887989008] [2019-11-20 09:47:05,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 09:47:05,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:05,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 09:47:05,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:47:05,030 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 5 states. [2019-11-20 09:47:05,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:05,140 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-11-20 09:47:05,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:47:05,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-20 09:47:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:05,148 INFO L225 Difference]: With dead ends: 38 [2019-11-20 09:47:05,149 INFO L226 Difference]: Without dead ends: 38 [2019-11-20 09:47:05,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:47:05,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-20 09:47:05,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-20 09:47:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-20 09:47:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-11-20 09:47:05,154 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 9 [2019-11-20 09:47:05,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:05,155 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-11-20 09:47:05,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 09:47:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-11-20 09:47:05,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 09:47:05,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:05,156 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:05,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:05,365 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-20 09:47:05,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:05,366 INFO L82 PathProgramCache]: Analyzing trace with hash 962562585, now seen corresponding path program 1 times [2019-11-20 09:47:05,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:05,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [214710043] [2019-11-20 09:47:05,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:05,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 09:47:05,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:05,513 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_45|], 3=[|v_#valid_74|]} [2019-11-20 09:47:05,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:47:05,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:47:05,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:47:05,578 INFO L343 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2019-11-20 09:47:05,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2019-11-20 09:47:05,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:05,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:05,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-11-20 09:47:05,630 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:05,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:05,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:05,664 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:36 [2019-11-20 09:47:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:05,724 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:05,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [214710043] [2019-11-20 09:47:05,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:47:05,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 09:47:05,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404816743] [2019-11-20 09:47:05,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:47:05,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:05,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:47:05,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:47:05,772 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 4 states. [2019-11-20 09:47:05,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:05,872 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-11-20 09:47:05,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:47:05,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-20 09:47:05,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:05,874 INFO L225 Difference]: With dead ends: 34 [2019-11-20 09:47:05,874 INFO L226 Difference]: Without dead ends: 34 [2019-11-20 09:47:05,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:47:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-20 09:47:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-20 09:47:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-20 09:47:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-20 09:47:05,877 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 9 [2019-11-20 09:47:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:05,877 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-20 09:47:05,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:47:05,878 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-20 09:47:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 09:47:05,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:05,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:06,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:06,079 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-20 09:47:06,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:06,079 INFO L82 PathProgramCache]: Analyzing trace with hash -225330983, now seen corresponding path program 1 times [2019-11-20 09:47:06,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:06,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [158598726] [2019-11-20 09:47:06,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:06,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 09:47:06,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:06,289 INFO L343 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2019-11-20 09:47:06,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2019-11-20 09:47:06,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:06,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:06,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:06,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:15, output treesize:21 [2019-11-20 09:47:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:06,323 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:06,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [158598726] [2019-11-20 09:47:06,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:47:06,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-20 09:47:06,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773408019] [2019-11-20 09:47:06,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:47:06,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:06,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:47:06,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:47:06,346 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2019-11-20 09:47:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:06,434 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-11-20 09:47:06,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:47:06,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 09:47:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:06,436 INFO L225 Difference]: With dead ends: 31 [2019-11-20 09:47:06,436 INFO L226 Difference]: Without dead ends: 31 [2019-11-20 09:47:06,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:47:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-20 09:47:06,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-20 09:47:06,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 09:47:06,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-11-20 09:47:06,440 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 10 [2019-11-20 09:47:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:06,441 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-11-20 09:47:06,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:47:06,441 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-11-20 09:47:06,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 09:47:06,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:06,442 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:06,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:06,642 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-20 09:47:06,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:06,643 INFO L82 PathProgramCache]: Analyzing trace with hash -225330982, now seen corresponding path program 1 times [2019-11-20 09:47:06,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:06,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [496105100] [2019-11-20 09:47:06,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:06,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 09:47:06,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:06,811 INFO L343 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2019-11-20 09:47:06,812 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2019-11-20 09:47:06,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:06,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:06,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:06,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:19, output treesize:24 [2019-11-20 09:47:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:06,862 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:06,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [496105100] [2019-11-20 09:47:06,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:47:06,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 09:47:06,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902039388] [2019-11-20 09:47:06,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:47:06,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:06,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:47:06,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:47:06,893 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2019-11-20 09:47:06,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:06,936 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-11-20 09:47:06,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:47:06,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 09:47:06,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:06,937 INFO L225 Difference]: With dead ends: 28 [2019-11-20 09:47:06,937 INFO L226 Difference]: Without dead ends: 28 [2019-11-20 09:47:06,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:47:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-20 09:47:06,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-20 09:47:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 09:47:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-11-20 09:47:06,941 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2019-11-20 09:47:06,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:06,941 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-20 09:47:06,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:47:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-11-20 09:47:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 09:47:06,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:06,942 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:07,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:07,143 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-20 09:47:07,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:07,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1860435007, now seen corresponding path program 1 times [2019-11-20 09:47:07,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:07,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [981265261] [2019-11-20 09:47:07,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:07,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 09:47:07,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:07,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 09:47:07,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:07,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:07,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:07,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-20 09:47:07,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 09:47:07,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:07,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:07,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:07,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-20 09:47:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:07,291 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:07,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [981265261] [2019-11-20 09:47:07,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:47:07,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 09:47:07,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421542825] [2019-11-20 09:47:07,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:47:07,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:07,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:47:07,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:47:07,302 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 4 states. [2019-11-20 09:47:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:07,437 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-11-20 09:47:07,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:47:07,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-20 09:47:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:07,438 INFO L225 Difference]: With dead ends: 43 [2019-11-20 09:47:07,438 INFO L226 Difference]: Without dead ends: 43 [2019-11-20 09:47:07,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-20 09:47:07,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-20 09:47:07,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2019-11-20 09:47:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-20 09:47:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-20 09:47:07,444 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 14 [2019-11-20 09:47:07,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:07,444 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-20 09:47:07,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:47:07,444 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-20 09:47:07,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 09:47:07,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:07,445 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:07,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:07,646 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-20 09:47:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:07,647 INFO L82 PathProgramCache]: Analyzing trace with hash 988980839, now seen corresponding path program 1 times [2019-11-20 09:47:07,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:07,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [651627072] [2019-11-20 09:47:07,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:07,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 09:47:07,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:07,825 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:07,825 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-20 09:47:07,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:07,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:07,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:07,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:4 [2019-11-20 09:47:07,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 09:47:07,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:07,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:07,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:07,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-20 09:47:07,890 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-20 09:47:07,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:07,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:07,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:07,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-20 09:47:07,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 09:47:07,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:07,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:07,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:07,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-20 09:47:07,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:07,947 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:07,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [651627072] [2019-11-20 09:47:07,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:47:07,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-20 09:47:07,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707349055] [2019-11-20 09:47:07,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 09:47:07,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:07,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 09:47:07,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 09:47:07,992 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 7 states. [2019-11-20 09:47:08,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:08,269 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-11-20 09:47:08,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 09:47:08,270 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-20 09:47:08,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:08,272 INFO L225 Difference]: With dead ends: 49 [2019-11-20 09:47:08,273 INFO L226 Difference]: Without dead ends: 49 [2019-11-20 09:47:08,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-20 09:47:08,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-20 09:47:08,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-11-20 09:47:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-20 09:47:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-20 09:47:08,277 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 19 [2019-11-20 09:47:08,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:08,277 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-20 09:47:08,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 09:47:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-20 09:47:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 09:47:08,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:08,279 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:08,479 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:08,479 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-20 09:47:08,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:08,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1875845268, now seen corresponding path program 1 times [2019-11-20 09:47:08,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:08,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1846762117] [2019-11-20 09:47:08,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:08,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 09:47:08,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:08,669 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-11-20 09:47:08,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:08,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:08,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:08,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:15 [2019-11-20 09:47:08,726 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 09:47:08,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:08,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:08,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:08,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 09:47:08,860 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:08,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 46 [2019-11-20 09:47:08,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:08,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:08,898 INFO L567 ElimStorePlain]: treesize reduction 16, result has 61.9 percent of original size [2019-11-20 09:47:08,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:08,900 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2019-11-20 09:47:08,955 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:08,955 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2019-11-20 09:47:08,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:09,012 INFO L567 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2019-11-20 09:47:09,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:09,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:09,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:41 [2019-11-20 09:47:09,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:09,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:09,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-20 09:47:09,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:09,075 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:09,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2019-11-20 09:47:09,076 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:09,105 INFO L567 ElimStorePlain]: treesize reduction 22, result has 26.7 percent of original size [2019-11-20 09:47:09,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:09,105 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:3 [2019-11-20 09:47:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:09,128 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:09,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2019-11-20 09:47:09,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:09,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:09,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:09,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:79, output treesize:12 [2019-11-20 09:47:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:09,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1846762117] [2019-11-20 09:47:09,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:47:09,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-11-20 09:47:09,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118457286] [2019-11-20 09:47:09,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 09:47:09,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:09,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 09:47:09,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-20 09:47:09,423 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 15 states. [2019-11-20 09:47:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:12,410 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-11-20 09:47:12,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 09:47:12,411 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-20 09:47:12,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:12,412 INFO L225 Difference]: With dead ends: 57 [2019-11-20 09:47:12,412 INFO L226 Difference]: Without dead ends: 57 [2019-11-20 09:47:12,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2019-11-20 09:47:12,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-20 09:47:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-11-20 09:47:12,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-20 09:47:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-11-20 09:47:12,417 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 22 [2019-11-20 09:47:12,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:12,417 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-11-20 09:47:12,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 09:47:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-11-20 09:47:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 09:47:12,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:12,419 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:12,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:12,619 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-20 09:47:12,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:12,620 INFO L82 PathProgramCache]: Analyzing trace with hash -230868331, now seen corresponding path program 1 times [2019-11-20 09:47:12,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:12,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [530657835] [2019-11-20 09:47:12,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:12,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 09:47:12,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:12,768 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-11-20 09:47:12,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:12,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:12,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:12,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:19 [2019-11-20 09:47:12,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 09:47:12,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:12,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:12,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:12,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-20 09:47:13,028 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:13,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 46 [2019-11-20 09:47:13,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:13,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:13,070 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-11-20 09:47:13,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:13,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2019-11-20 09:47:13,154 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:13,154 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2019-11-20 09:47:13,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:13,224 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.7 percent of original size [2019-11-20 09:47:13,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:13,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 [2019-11-20 09:47:13,320 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:13,321 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2019-11-20 09:47:13,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:13,377 INFO L567 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2019-11-20 09:47:13,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:13,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:13,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:41 [2019-11-20 09:47:13,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:13,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:13,442 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:13,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2019-11-20 09:47:13,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:13,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-11-20 09:47:13,448 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:13,464 INFO L567 ElimStorePlain]: treesize reduction 22, result has 26.7 percent of original size [2019-11-20 09:47:13,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:13,464 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:68, output treesize:3 [2019-11-20 09:47:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:13,484 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:13,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2019-11-20 09:47:13,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:13,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:13,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:13,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:79, output treesize:12 [2019-11-20 09:47:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:13,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [530657835] [2019-11-20 09:47:13,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:47:13,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-20 09:47:13,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072746545] [2019-11-20 09:47:13,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 09:47:13,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:13,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 09:47:13,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-11-20 09:47:13,855 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 16 states. [2019-11-20 09:47:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:15,265 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2019-11-20 09:47:15,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 09:47:15,266 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-11-20 09:47:15,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:15,267 INFO L225 Difference]: With dead ends: 66 [2019-11-20 09:47:15,267 INFO L226 Difference]: Without dead ends: 66 [2019-11-20 09:47:15,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=214, Invalid=436, Unknown=0, NotChecked=0, Total=650 [2019-11-20 09:47:15,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-20 09:47:15,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2019-11-20 09:47:15,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-20 09:47:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-11-20 09:47:15,272 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 25 [2019-11-20 09:47:15,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:15,273 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-11-20 09:47:15,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 09:47:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2019-11-20 09:47:15,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 09:47:15,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:15,274 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:15,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:15,477 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-20 09:47:15,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:15,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1764690337, now seen corresponding path program 1 times [2019-11-20 09:47:15,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:15,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2048994561] [2019-11-20 09:47:15,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:15,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 09:47:15,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:15,660 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:15,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-20 09:47:15,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:15,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:15,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:15,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2019-11-20 09:47:15,698 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 09:47:15,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:15,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:15,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:15,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-20 09:47:15,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-20 09:47:15,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:15,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:15,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:15,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-11-20 09:47:15,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-20 09:47:15,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:15,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:15,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:15,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2019-11-20 09:47:15,985 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:15,986 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 102 [2019-11-20 09:47:15,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:16,080 INFO L567 ElimStorePlain]: treesize reduction 64, result has 40.7 percent of original size [2019-11-20 09:47:16,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:16,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:48, output treesize:44 [2019-11-20 09:47:16,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 09:47:16,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:16,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:16,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:16,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-11-20 09:47:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:16,172 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:16,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:16,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:16,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:16,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:1 [2019-11-20 09:47:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:16,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2048994561] [2019-11-20 09:47:16,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:47:16,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 5] imperfect sequences [] total 10 [2019-11-20 09:47:16,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944673105] [2019-11-20 09:47:16,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 09:47:16,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:16,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 09:47:16,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 09:47:16,307 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 10 states. [2019-11-20 09:47:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:25,340 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2019-11-20 09:47:25,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 09:47:25,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-20 09:47:25,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:25,343 INFO L225 Difference]: With dead ends: 80 [2019-11-20 09:47:25,343 INFO L226 Difference]: Without dead ends: 80 [2019-11-20 09:47:25,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-11-20 09:47:25,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-20 09:47:25,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 49. [2019-11-20 09:47:25,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-20 09:47:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-11-20 09:47:25,348 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 26 [2019-11-20 09:47:25,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:25,349 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-11-20 09:47:25,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 09:47:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-11-20 09:47:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 09:47:25,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:25,350 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:25,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:25,551 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-20 09:47:25,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:25,551 INFO L82 PathProgramCache]: Analyzing trace with hash -687360055, now seen corresponding path program 1 times [2019-11-20 09:47:25,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:25,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [897240027] [2019-11-20 09:47:25,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:25,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 09:47:25,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:25,779 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:25,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-11-20 09:47:25,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:25,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:25,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:25,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:25 [2019-11-20 09:47:25,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 09:47:25,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:25,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:25,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:25,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-20 09:47:25,901 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-20 09:47:25,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:25,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:25,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:25,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2019-11-20 09:47:25,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-20 09:47:25,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:26,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:26,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:26,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:46 [2019-11-20 09:47:26,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2019-11-20 09:47:26,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:26,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:26,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:26,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:53 [2019-11-20 09:47:26,199 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2019-11-20 09:47:26,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:26,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:26,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:26,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:53 [2019-11-20 09:47:26,381 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2019-11-20 09:47:26,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:26,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:26,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:26,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:60, output treesize:3 [2019-11-20 09:47:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:26,445 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:34,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [897240027] [2019-11-20 09:47:34,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 09:47:34,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 11 [2019-11-20 09:47:34,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358680550] [2019-11-20 09:47:34,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 09:47:34,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:34,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 09:47:34,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-20 09:47:34,657 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 9 states. [2019-11-20 09:47:37,140 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-11-20 09:47:39,459 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-11-20 09:47:39,684 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-11-20 09:47:39,864 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-20 09:47:45,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:47:45,289 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2019-11-20 09:47:45,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 09:47:45,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-20 09:47:45,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:47:45,290 INFO L225 Difference]: With dead ends: 103 [2019-11-20 09:47:45,290 INFO L226 Difference]: Without dead ends: 103 [2019-11-20 09:47:45,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=102, Invalid=203, Unknown=1, NotChecked=0, Total=306 [2019-11-20 09:47:45,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-20 09:47:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 73. [2019-11-20 09:47:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-20 09:47:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2019-11-20 09:47:45,295 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 31 [2019-11-20 09:47:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:47:45,295 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2019-11-20 09:47:45,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 09:47:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2019-11-20 09:47:45,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 09:47:45,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:47:45,296 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:47:45,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:45,503 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-20 09:47:45,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:47:45,503 INFO L82 PathProgramCache]: Analyzing trace with hash 210942700, now seen corresponding path program 1 times [2019-11-20 09:47:45,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:47:45,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1314358227] [2019-11-20 09:47:45,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:47:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:47:45,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 09:47:45,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:47:45,660 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:45,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-11-20 09:47:45,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:45,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:45,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:45,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:21 [2019-11-20 09:47:45,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 09:47:45,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:45,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:45,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:45,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-11-20 09:47:45,737 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-20 09:47:45,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:45,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:45,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:45,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-11-20 09:47:45,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-20 09:47:45,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:45,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:45,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:45,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:42 [2019-11-20 09:47:45,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-11-20 09:47:45,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:45,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:45,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:45,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:42 [2019-11-20 09:47:45,998 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:45,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 62 [2019-11-20 09:47:45,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:46,120 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-20 09:47:46,121 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.1 percent of original size [2019-11-20 09:47:46,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:46,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:57 [2019-11-20 09:47:46,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:46,499 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:46,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 99 [2019-11-20 09:47:46,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:46,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2019-11-20 09:47:46,528 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:46,666 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-11-20 09:47:46,667 INFO L567 ElimStorePlain]: treesize reduction 82, result has 37.4 percent of original size [2019-11-20 09:47:46,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:46,668 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:124, output treesize:49 [2019-11-20 09:47:46,787 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:46,787 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 79 [2019-11-20 09:47:46,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:46,867 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.1 percent of original size [2019-11-20 09:47:46,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:46,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:46,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:57 [2019-11-20 09:47:46,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:46,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:47,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:47,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:47:47,129 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-11-20 09:47:47,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:47,179 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:47,179 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 99 [2019-11-20 09:47:47,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:47,280 INFO L567 ElimStorePlain]: treesize reduction 83, result has 29.1 percent of original size [2019-11-20 09:47:47,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 09:47:47,281 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:34 [2019-11-20 09:47:48,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 09:47:48,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:47:48,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:47:48,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:47:48,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2019-11-20 09:47:48,662 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:47:48,662 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:47:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 09:47:55,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1314358227] [2019-11-20 09:47:55,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:47:55,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2019-11-20 09:47:55,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028348011] [2019-11-20 09:47:55,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 09:47:55,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:47:55,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 09:47:55,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-20 09:47:55,104 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 16 states. [2019-11-20 09:48:12,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:48:12,355 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2019-11-20 09:48:12,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 09:48:12,355 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2019-11-20 09:48:12,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:48:12,356 INFO L225 Difference]: With dead ends: 131 [2019-11-20 09:48:12,356 INFO L226 Difference]: Without dead ends: 131 [2019-11-20 09:48:12,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 64 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-11-20 09:48:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-20 09:48:12,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2019-11-20 09:48:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-20 09:48:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2019-11-20 09:48:12,362 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 44 [2019-11-20 09:48:12,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:48:12,366 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2019-11-20 09:48:12,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 09:48:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2019-11-20 09:48:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 09:48:12,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:48:12,368 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:48:12,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:48:12,571 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-20 09:48:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:48:12,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2053442217, now seen corresponding path program 1 times [2019-11-20 09:48:12,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:48:12,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1371643921] [2019-11-20 09:48:12,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:48:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:48:12,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-20 09:48:12,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:48:12,810 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 09:48:12,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:12,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:12,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:48:12,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 09:48:12,931 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 09:48:12,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:12,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:12,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:48:12,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:104, output treesize:100 [2019-11-20 09:48:13,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:48:13,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-20 09:48:13,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:13,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:13,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:48:13,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:93 [2019-11-20 09:48:13,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 09:48:13,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:13,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:13,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:48:13,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:94 [2019-11-20 09:48:13,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:48:13,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:48:13,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:48:13,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-11-20 09:48:13,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:13,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:13,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:48:13,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:108, output treesize:104 [2019-11-20 09:48:13,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:48:13,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:48:13,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:48:13,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2019-11-20 09:48:13,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:13,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:13,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:48:13,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:78 [2019-11-20 09:48:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 09:48:16,121 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:48:16,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 09:48:16,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:16,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:16,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:48:16,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:30 [2019-11-20 09:48:16,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2019-11-20 09:48:16,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:16,910 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2019-11-20 09:48:16,911 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:16,929 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2019-11-20 09:48:16,930 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:16,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2019-11-20 09:48:16,944 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 09:48:17,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:48:17,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-11-20 09:48:17,028 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:153, output treesize:117 [2019-11-20 09:48:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 73 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 09:48:35,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1371643921] [2019-11-20 09:48:35,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:48:35,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2019-11-20 09:48:35,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826790622] [2019-11-20 09:48:35,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-20 09:48:35,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:48:35,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-20 09:48:35,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=419, Unknown=9, NotChecked=0, Total=600 [2019-11-20 09:48:35,717 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand 25 states. [2019-11-20 09:48:38,305 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-20 09:48:38,511 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 09:48:38,695 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 09:48:39,089 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-11-20 09:48:39,426 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-11-20 09:48:40,482 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-11-20 09:48:40,808 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-11-20 09:48:41,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:48:41,151 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2019-11-20 09:48:41,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 09:48:41,153 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 73 [2019-11-20 09:48:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:48:41,154 INFO L225 Difference]: With dead ends: 143 [2019-11-20 09:48:41,154 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 09:48:41,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=456, Invalid=941, Unknown=9, NotChecked=0, Total=1406 [2019-11-20 09:48:41,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 09:48:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 09:48:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 09:48:41,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 09:48:41,155 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2019-11-20 09:48:41,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:48:41,156 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 09:48:41,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-20 09:48:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 09:48:41,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 09:48:41,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:48:41,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:48:41 BoogieIcfgContainer [2019-11-20 09:48:41,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 09:48:41,361 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 09:48:41,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 09:48:41,361 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 09:48:41,362 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:47:01" (3/4) ... [2019-11-20 09:48:41,365 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 09:48:41,369 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-20 09:48:41,370 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-20 09:48:41,374 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-20 09:48:41,374 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-20 09:48:41,375 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 09:48:41,375 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 09:48:41,424 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3c6d2aab-0ffc-40df-b616-415397504c8a/bin/uautomizer/witness.graphml [2019-11-20 09:48:41,425 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 09:48:41,426 INFO L168 Benchmark]: Toolchain (without parser) took 101244.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:48:41,426 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:48:41,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 430.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-20 09:48:41,427 INFO L168 Benchmark]: Boogie Preprocessor took 47.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:48:41,427 INFO L168 Benchmark]: RCFGBuilder took 617.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-20 09:48:41,428 INFO L168 Benchmark]: TraceAbstraction took 100079.70 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 33.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -30.6 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. [2019-11-20 09:48:41,428 INFO L168 Benchmark]: Witness Printer took 63.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2019-11-20 09:48:41,430 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.31 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 430.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 617.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 100079.70 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 33.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -30.6 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. * Witness Printer took 63.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 61 locations, 31 error locations. Result: SAFE, OverallTime: 99.9s, OverallIterations: 16, TraceHistogramMax: 9, AutomataDifference: 48.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 319 SDtfs, 976 SDslu, 794 SDs, 0 SdLazy, 1494 SolverSat, 288 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 40.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 686 GetRequests, 501 SyntacticMatches, 21 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 48.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 133 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 45.9s InterpolantComputationTime, 322 NumberOfCodeBlocks, 322 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 612 ConstructedInterpolants, 100 QuantifiedInterpolants, 975667 SizeOfPredicates, 175 NumberOfNonLiveVariables, 1570 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 32 InterpolantComputations, 21 PerfectInterpolantSequences, 184/416 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...