./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_e3a990d9-7c41-4b82-9b70-a671cb64be77/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-circular-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/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 32bit --witnessprinter.graph.data.programhash 647186f77af479db589ba9ca6b990f259feeb9ca ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 00:07:22,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:07:22,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:07:22,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:07:22,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:07:22,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:07:22,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:07:22,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:07:22,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:07:22,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:07:22,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:07:22,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:07:22,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:07:22,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:07:22,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:07:22,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:07:22,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:07:22,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:07:22,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:07:22,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:07:22,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:07:22,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:07:22,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:07:22,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:07:22,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:07:22,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:07:22,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:07:22,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:07:22,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:07:22,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:07:22,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:07:22,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:07:22,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:07:22,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:07:22,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:07:22,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:07:22,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:07:22,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:07:22,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:07:22,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:07:22,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:07:22,506 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 00:07:22,518 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:07:22,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:07:22,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:07:22,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:07:22,520 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:07:22,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:07:22,520 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:07:22,521 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 00:07:22,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:07:22,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:07:22,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:07:22,521 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 00:07:22,522 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 00:07:22,522 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 00:07:22,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:07:22,522 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 00:07:22,523 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 00:07:22,523 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:07:22,523 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:07:22,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:07:22,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:07:22,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:07:22,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:07:22,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:07:22,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:07:22,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:07:22,525 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 00:07:22,525 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 00:07:22,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 00:07:22,525 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_e3a990d9-7c41-4b82-9b70-a671cb64be77/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 647186f77af479db589ba9ca6b990f259feeb9ca [2019-11-20 00:07:22,659 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:07:22,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:07:22,674 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:07:22,675 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:07:22,676 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:07:22,676 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-circular-2.i [2019-11-20 00:07:22,728 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/bin/uautomizer/data/98330b695/cbe82a323e624a028f9197664009dde3/FLAGbcf65e09c [2019-11-20 00:07:23,260 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:07:23,261 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/sv-benchmarks/c/forester-heap/dll-circular-2.i [2019-11-20 00:07:23,277 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/bin/uautomizer/data/98330b695/cbe82a323e624a028f9197664009dde3/FLAGbcf65e09c [2019-11-20 00:07:23,751 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/bin/uautomizer/data/98330b695/cbe82a323e624a028f9197664009dde3 [2019-11-20 00:07:23,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:07:23,755 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 00:07:23,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:07:23,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:07:23,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:07:23,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:07:23" (1/1) ... [2019-11-20 00:07:23,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71cb7a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:23, skipping insertion in model container [2019-11-20 00:07:23,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:07:23" (1/1) ... [2019-11-20 00:07:23,774 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:07:23,814 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:07:24,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:07:24,191 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:07:24,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:07:24,307 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:07:24,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:24 WrapperNode [2019-11-20 00:07:24,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:07:24,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:07:24,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:07:24,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:07:24,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:24" (1/1) ... [2019-11-20 00:07:24,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:24" (1/1) ... [2019-11-20 00:07:24,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:24" (1/1) ... [2019-11-20 00:07:24,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:24" (1/1) ... [2019-11-20 00:07:24,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:24" (1/1) ... [2019-11-20 00:07:24,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:24" (1/1) ... [2019-11-20 00:07:24,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:24" (1/1) ... [2019-11-20 00:07:24,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:07:24,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:07:24,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:07:24,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:07:24,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/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 00:07:24,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 00:07:24,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:07:24,451 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 00:07:24,452 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 00:07:24,452 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 00:07:24,452 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 00:07:24,452 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 00:07:24,452 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 00:07:24,453 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 00:07:24,453 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 00:07:24,453 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 00:07:24,453 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 00:07:24,453 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 00:07:24,454 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 00:07:24,454 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 00:07:24,454 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 00:07:24,454 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 00:07:24,454 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 00:07:24,454 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 00:07:24,455 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 00:07:24,455 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 00:07:24,455 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 00:07:24,455 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 00:07:24,455 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 00:07:24,456 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 00:07:24,456 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 00:07:24,456 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 00:07:24,456 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 00:07:24,456 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 00:07:24,457 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 00:07:24,457 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 00:07:24,457 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 00:07:24,457 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 00:07:24,457 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 00:07:24,458 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 00:07:24,458 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 00:07:24,458 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 00:07:24,458 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 00:07:24,458 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 00:07:24,458 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 00:07:24,459 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 00:07:24,459 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 00:07:24,459 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 00:07:24,459 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 00:07:24,459 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 00:07:24,459 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 00:07:24,459 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 00:07:24,460 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 00:07:24,460 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 00:07:24,460 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 00:07:24,460 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 00:07:24,460 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 00:07:24,460 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 00:07:24,461 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 00:07:24,461 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 00:07:24,461 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 00:07:24,461 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 00:07:24,461 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-20 00:07:24,461 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 00:07:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 00:07:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 00:07:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 00:07:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 00:07:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 00:07:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 00:07:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 00:07:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 00:07:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 00:07:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 00:07:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 00:07:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 00:07:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 00:07:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 00:07:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 00:07:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 00:07:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 00:07:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 00:07:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 00:07:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 00:07:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 00:07:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 00:07:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 00:07:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 00:07:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 00:07:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 00:07:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 00:07:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 00:07:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 00:07:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 00:07:24,467 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 00:07:24,467 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 00:07:24,467 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 00:07:24,467 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 00:07:24,467 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 00:07:24,467 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 00:07:24,468 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 00:07:24,468 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 00:07:24,468 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 00:07:24,468 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 00:07:24,468 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 00:07:24,468 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 00:07:24,469 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 00:07:24,469 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 00:07:24,469 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 00:07:24,469 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 00:07:24,469 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 00:07:24,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 00:07:24,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 00:07:24,470 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 00:07:24,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 00:07:24,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 00:07:24,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 00:07:24,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 00:07:24,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 00:07:24,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 00:07:24,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 00:07:24,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:07:25,463 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:07:25,463 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-20 00:07:25,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:07:25 BoogieIcfgContainer [2019-11-20 00:07:25,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:07:25,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:07:25,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:07:25,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:07:25,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:07:23" (1/3) ... [2019-11-20 00:07:25,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3930f156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:07:25, skipping insertion in model container [2019-11-20 00:07:25,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:24" (2/3) ... [2019-11-20 00:07:25,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3930f156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:07:25, skipping insertion in model container [2019-11-20 00:07:25,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:07:25" (3/3) ... [2019-11-20 00:07:25,473 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2019-11-20 00:07:25,483 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:07:25,490 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2019-11-20 00:07:25,502 INFO L249 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2019-11-20 00:07:25,524 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:07:25,524 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 00:07:25,524 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:07:25,525 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:07:25,525 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:07:25,525 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:07:25,525 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:07:25,525 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:07:25,552 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-20 00:07:25,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 00:07:25,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:07:25,566 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:07:25,567 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 00:07:25,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:07:25,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1381924233, now seen corresponding path program 1 times [2019-11-20 00:07:25,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:07:25,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [412527271] [2019-11-20 00:07:25,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/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 00:07:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:07:25,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:07:25,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:07:25,844 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 00:07:25,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:25,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:25,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:25,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 00:07:25,864 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 00:07:25,864 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:07:25,874 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 00:07:25,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [412527271] [2019-11-20 00:07:25,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:07:25,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 00:07:25,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274017802] [2019-11-20 00:07:25,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:07:25,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:07:25,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:07:25,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:07:25,897 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 3 states. [2019-11-20 00:07:26,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:07:26,199 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2019-11-20 00:07:26,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:07:26,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-20 00:07:26,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:07:26,210 INFO L225 Difference]: With dead ends: 113 [2019-11-20 00:07:26,210 INFO L226 Difference]: Without dead ends: 110 [2019-11-20 00:07:26,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:07:26,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-20 00:07:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2019-11-20 00:07:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 00:07:26,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2019-11-20 00:07:26,271 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 7 [2019-11-20 00:07:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:07:26,272 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2019-11-20 00:07:26,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:07:26,272 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2019-11-20 00:07:26,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 00:07:26,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:07:26,273 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:07:26,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:07:26,476 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 00:07:26,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:07:26,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1381924234, now seen corresponding path program 1 times [2019-11-20 00:07:26,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:07:26,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2060992742] [2019-11-20 00:07:26,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/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 00:07:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:07:26,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 00:07:26,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:07:26,644 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 00:07:26,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:26,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:26,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:26,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 00:07:26,675 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 00:07:26,675 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:07:26,723 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 00:07:26,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2060992742] [2019-11-20 00:07:26,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:07:26,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 00:07:26,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608403185] [2019-11-20 00:07:26,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:07:26,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:07:26,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:07:26,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:07:26,727 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 4 states. [2019-11-20 00:07:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:07:27,038 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2019-11-20 00:07:27,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:07:27,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-20 00:07:27,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:07:27,042 INFO L225 Difference]: With dead ends: 107 [2019-11-20 00:07:27,042 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 00:07:27,042 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 00:07:27,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 00:07:27,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2019-11-20 00:07:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-20 00:07:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2019-11-20 00:07:27,054 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 7 [2019-11-20 00:07:27,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:07:27,055 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2019-11-20 00:07:27,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:07:27,055 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2019-11-20 00:07:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 00:07:27,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:07:27,058 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:07:27,261 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:07:27,262 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 00:07:27,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:07:27,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1366062210, now seen corresponding path program 1 times [2019-11-20 00:07:27,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:07:27,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1437980168] [2019-11-20 00:07:27,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/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 00:07:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:07:27,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:07:27,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:07:27,451 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 00:07:27,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:27,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:27,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:27,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 00:07:27,494 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 00:07:27,494 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:07:27,606 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 00:07:27,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1437980168] [2019-11-20 00:07:27,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:07:27,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 00:07:27,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318834839] [2019-11-20 00:07:27,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 00:07:27,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:07:27,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:07:27,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:07:27,608 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 6 states. [2019-11-20 00:07:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:07:28,414 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2019-11-20 00:07:28,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 00:07:28,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-20 00:07:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:07:28,417 INFO L225 Difference]: With dead ends: 124 [2019-11-20 00:07:28,417 INFO L226 Difference]: Without dead ends: 124 [2019-11-20 00:07:28,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-20 00:07:28,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-20 00:07:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 101. [2019-11-20 00:07:28,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-20 00:07:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2019-11-20 00:07:28,427 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 12 [2019-11-20 00:07:28,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:07:28,428 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2019-11-20 00:07:28,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 00:07:28,428 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2019-11-20 00:07:28,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 00:07:28,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:07:28,429 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:07:28,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:07:28,632 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 00:07:28,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:07:28,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1366062211, now seen corresponding path program 1 times [2019-11-20 00:07:28,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:07:28,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [224124827] [2019-11-20 00:07:28,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/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 00:07:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:07:28,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 00:07:28,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:07:28,795 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 00:07:28,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:28,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:28,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:28,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 00:07:28,812 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 00:07:28,813 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:07:28,837 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 00:07:28,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [224124827] [2019-11-20 00:07:28,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:07:28,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 00:07:28,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122657759] [2019-11-20 00:07:28,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:07:28,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:07:28,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:07:28,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:07:28,839 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 4 states. [2019-11-20 00:07:29,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:07:29,092 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2019-11-20 00:07:29,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:07:29,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-20 00:07:29,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:07:29,093 INFO L225 Difference]: With dead ends: 98 [2019-11-20 00:07:29,094 INFO L226 Difference]: Without dead ends: 98 [2019-11-20 00:07:29,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 2 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 00:07:29,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-20 00:07:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2019-11-20 00:07:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-20 00:07:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2019-11-20 00:07:29,102 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 12 [2019-11-20 00:07:29,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:07:29,102 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2019-11-20 00:07:29,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:07:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2019-11-20 00:07:29,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 00:07:29,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:07:29,103 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:07:29,306 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:07:29,306 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 00:07:29,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:07:29,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1474213414, now seen corresponding path program 1 times [2019-11-20 00:07:29,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:07:29,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1881563573] [2019-11-20 00:07:29,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/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 00:07:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:07:29,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 00:07:29,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:07:29,553 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:29,554 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 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-20 00:07:29,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:29,573 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 00:07:29,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:29,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 00:07:29,591 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 00:07:29,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:29,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:29,597 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 00:07:29,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-11-20 00:07:29,610 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 19 treesize of output 11 [2019-11-20 00:07:29,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:29,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:29,613 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 00:07:29,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2019-11-20 00:07:29,621 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 00:07:29,621 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:07:29,642 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 00:07:29,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1881563573] [2019-11-20 00:07:29,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:07:29,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-11-20 00:07:29,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979452082] [2019-11-20 00:07:29,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 00:07:29,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:07:29,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:07:29,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:07:29,644 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 6 states. [2019-11-20 00:07:30,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:07:30,250 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2019-11-20 00:07:30,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:07:30,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-20 00:07:30,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:07:30,257 INFO L225 Difference]: With dead ends: 138 [2019-11-20 00:07:30,257 INFO L226 Difference]: Without dead ends: 138 [2019-11-20 00:07:30,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:07:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-20 00:07:30,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 88. [2019-11-20 00:07:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-20 00:07:30,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2019-11-20 00:07:30,273 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 14 [2019-11-20 00:07:30,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:07:30,273 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2019-11-20 00:07:30,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 00:07:30,273 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2019-11-20 00:07:30,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 00:07:30,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:07:30,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:07:30,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:07:30,475 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 00:07:30,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:07:30,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1474213415, now seen corresponding path program 1 times [2019-11-20 00:07:30,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:07:30,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1777133801] [2019-11-20 00:07:30,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/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 00:07:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:07:30,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:07:30,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:07:30,654 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 00:07:30,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:30,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:30,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:30,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 00:07:30,685 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 00:07:30,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:30,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:30,707 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 00:07:30,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:30,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:30,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:30,719 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2019-11-20 00:07:30,734 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 17 treesize of output 9 [2019-11-20 00:07:30,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:30,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:30,745 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 00:07:30,746 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:30,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:30,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:30,750 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:11 [2019-11-20 00:07:30,760 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 00:07:30,760 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:07:30,923 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 00:07:30,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1777133801] [2019-11-20 00:07:30,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:07:30,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 00:07:30,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845654562] [2019-11-20 00:07:30,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 00:07:30,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:07:30,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 00:07:30,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:07:30,924 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 8 states. [2019-11-20 00:07:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:07:31,875 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2019-11-20 00:07:31,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 00:07:31,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-20 00:07:31,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:07:31,876 INFO L225 Difference]: With dead ends: 136 [2019-11-20 00:07:31,876 INFO L226 Difference]: Without dead ends: 136 [2019-11-20 00:07:31,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-20 00:07:31,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-20 00:07:31,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 87. [2019-11-20 00:07:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-20 00:07:31,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2019-11-20 00:07:31,883 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 14 [2019-11-20 00:07:31,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:07:31,884 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2019-11-20 00:07:31,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 00:07:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2019-11-20 00:07:31,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 00:07:31,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:07:31,884 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:07:32,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:07:32,087 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 00:07:32,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:07:32,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2132887142, now seen corresponding path program 1 times [2019-11-20 00:07:32,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:07:32,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1713124277] [2019-11-20 00:07:32,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/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 00:07:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:07:32,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 00:07:32,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:07:32,256 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 00:07:32,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:32,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:32,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:32,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 00:07:32,273 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 00:07:32,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:32,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:32,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:32,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-20 00:07:32,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:32,296 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 21 treesize of output 20 [2019-11-20 00:07:32,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:32,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:32,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:32,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-20 00:07:32,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:32,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:32,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:32,328 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 36 treesize of output 23 [2019-11-20 00:07:32,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:32,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:32,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:32,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2019-11-20 00:07:32,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:32,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:32,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:32,389 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 36 treesize of output 23 [2019-11-20 00:07:32,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:32,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:32,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:32,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2019-11-20 00:07:32,406 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 00:07:32,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:32,418 INFO L567 ElimStorePlain]: treesize reduction 7, result has 56.3 percent of original size [2019-11-20 00:07:32,418 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 00:07:32,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:5 [2019-11-20 00:07:32,433 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 00:07:32,434 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:07:32,451 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:32,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:32,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:32,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:30 [2019-11-20 00:07:34,523 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:34,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:34,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:34,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:23 [2019-11-20 00:07:34,550 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 00:07:34,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1713124277] [2019-11-20 00:07:34,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:07:34,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 9 [2019-11-20 00:07:34,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610577220] [2019-11-20 00:07:34,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 00:07:34,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:07:34,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 00:07:34,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=61, Unknown=1, NotChecked=0, Total=90 [2019-11-20 00:07:34,552 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 10 states. [2019-11-20 00:07:37,073 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-11-20 00:07:48,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:07:48,414 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2019-11-20 00:07:48,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 00:07:48,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-20 00:07:48,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:07:48,415 INFO L225 Difference]: With dead ends: 139 [2019-11-20 00:07:48,416 INFO L226 Difference]: Without dead ends: 139 [2019-11-20 00:07:48,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=83, Invalid=155, Unknown=2, NotChecked=0, Total=240 [2019-11-20 00:07:48,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-20 00:07:48,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 93. [2019-11-20 00:07:48,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-20 00:07:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2019-11-20 00:07:48,421 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 17 [2019-11-20 00:07:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:07:48,421 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2019-11-20 00:07:48,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 00:07:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2019-11-20 00:07:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 00:07:48,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:07:48,422 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:07:48,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:07:48,623 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 00:07:48,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:07:48,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2132887143, now seen corresponding path program 1 times [2019-11-20 00:07:48,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:07:48,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1512316890] [2019-11-20 00:07:48,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/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 00:07:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:07:48,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 00:07:48,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:07:48,800 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 00:07:48,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:48,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:48,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:48,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 00:07:48,834 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 00:07:48,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:48,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:48,853 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 00:07:48,854 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:48,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:48,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:48,863 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2019-11-20 00:07:48,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:48,885 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 21 treesize of output 20 [2019-11-20 00:07:48,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:48,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:48,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:48,915 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 21 treesize of output 20 [2019-11-20 00:07:48,915 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:48,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:48,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:48,938 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-11-20 00:07:48,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:48,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:48,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:48,975 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 36 treesize of output 23 [2019-11-20 00:07:48,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:49,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:49,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:49,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:49,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:49,008 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 36 treesize of output 23 [2019-11-20 00:07:49,009 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:49,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:49,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:49,033 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:43 [2019-11-20 00:07:49,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:49,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:49,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:49,087 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 36 treesize of output 23 [2019-11-20 00:07:49,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:49,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:49,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:49,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:49,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:07:49,145 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 36 treesize of output 23 [2019-11-20 00:07:49,146 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:49,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:49,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:49,168 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:43 [2019-11-20 00:07:49,177 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 00:07:49,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:49,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:49,193 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 00:07:49,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:49,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:49,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:49,211 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:11 [2019-11-20 00:07:49,251 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 00:07:49,251 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:07:49,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:07:49,429 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:49,439 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:49,451 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:49,586 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 00:07:49,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:49,595 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:49,603 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:49,614 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:49,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:49,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-20 00:07:49,664 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:163, output treesize:90 [2019-11-20 00:07:50,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:07:50,026 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:50,034 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:50,039 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:50,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:50,096 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:50,101 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:50,105 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:50,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:50,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-20 00:07:50,163 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:163, output treesize:65 [2019-11-20 00:07:50,362 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 00:07:50,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1512316890] [2019-11-20 00:07:50,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:07:50,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 12 [2019-11-20 00:07:50,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938931266] [2019-11-20 00:07:50,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 00:07:50,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:07:50,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 00:07:50,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:07:50,364 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 13 states. [2019-11-20 00:07:51,563 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-11-20 00:07:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:07:52,736 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2019-11-20 00:07:52,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 00:07:52,738 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-11-20 00:07:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:07:52,739 INFO L225 Difference]: With dead ends: 160 [2019-11-20 00:07:52,739 INFO L226 Difference]: Without dead ends: 160 [2019-11-20 00:07:52,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-11-20 00:07:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-20 00:07:52,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-11-20 00:07:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-20 00:07:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2019-11-20 00:07:52,747 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 17 [2019-11-20 00:07:52,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:07:52,747 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2019-11-20 00:07:52,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 00:07:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2019-11-20 00:07:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 00:07:52,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:07:52,748 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:07:52,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:07:52,949 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 00:07:52,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:07:52,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1068216232, now seen corresponding path program 1 times [2019-11-20 00:07:52,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:07:52,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [557161329] [2019-11-20 00:07:52,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/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 00:07:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:07:53,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 00:07:53,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:07:53,120 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 00:07:53,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:53,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:53,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:53,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 00:07:53,155 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:53,156 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 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-20 00:07:53,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:53,173 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-20 00:07:53,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:53,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-20 00:07:53,193 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 00:07:53,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:53,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:53,204 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 00:07:53,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2019-11-20 00:07:53,267 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:53,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 59 [2019-11-20 00:07:53,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:07:53,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:07:53,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 00:07:53,328 INFO L567 ElimStorePlain]: treesize reduction 40, result has 49.4 percent of original size [2019-11-20 00:07:53,328 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 00:07:53,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2019-11-20 00:07:53,371 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:53,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2019-11-20 00:07:53,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:53,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:53,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:53,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:17 [2019-11-20 00:07:53,423 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 00:07:53,423 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:07:53,518 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 00:07:53,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [557161329] [2019-11-20 00:07:53,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:07:53,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2019-11-20 00:07:53,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524025017] [2019-11-20 00:07:53,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 00:07:53,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:07:53,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 00:07:53,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-20 00:07:53,520 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 14 states. [2019-11-20 00:07:54,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:07:54,949 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2019-11-20 00:07:54,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 00:07:54,950 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-11-20 00:07:54,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:07:54,951 INFO L225 Difference]: With dead ends: 155 [2019-11-20 00:07:54,951 INFO L226 Difference]: Without dead ends: 155 [2019-11-20 00:07:54,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=444, Unknown=0, NotChecked=0, Total=650 [2019-11-20 00:07:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-20 00:07:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 104. [2019-11-20 00:07:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 00:07:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2019-11-20 00:07:54,956 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 18 [2019-11-20 00:07:54,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:07:54,957 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2019-11-20 00:07:54,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 00:07:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2019-11-20 00:07:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 00:07:54,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:07:54,958 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:07:55,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:07:55,159 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 00:07:55,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:07:55,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1068216233, now seen corresponding path program 1 times [2019-11-20 00:07:55,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:07:55,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1197999187] [2019-11-20 00:07:55,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/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 00:07:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:07:55,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 00:07:55,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:07:55,356 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 00:07:55,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:55,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:55,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:55,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 00:07:55,367 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_60|], 1=[|v_#valid_102|]} [2019-11-20 00:07:55,369 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 00:07:55,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:55,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:55,384 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:55,385 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 13 treesize of output 17 [2019-11-20 00:07:55,385 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:55,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:55,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:55,392 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-11-20 00:07:55,408 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 00:07:55,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:55,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:55,423 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 00:07:55,423 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:55,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:55,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:55,433 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:25 [2019-11-20 00:07:55,514 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 29 treesize of output 24 [2019-11-20 00:07:55,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:55,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:55,591 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:55,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 66 [2019-11-20 00:07:55,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:07:55,593 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:55,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:55,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:07:55,624 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:53 [2019-11-20 00:07:55,707 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:55,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 44 [2019-11-20 00:07:55,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:55,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:55,738 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 24 treesize of output 10 [2019-11-20 00:07:55,739 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:07:55,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:07:55,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:07:55,745 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:67, output treesize:9 [2019-11-20 00:07:55,778 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 00:07:55,778 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:07:58,628 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-20 00:08:01,796 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-20 00:08:01,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:08:02,227 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 00:08:02,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:08:02,235 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:08:02,478 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 00:08:02,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:08:02,489 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 00:08:02,887 WARN L191 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-20 00:08:02,887 INFO L567 ElimStorePlain]: treesize reduction 58, result has 69.1 percent of original size [2019-11-20 00:08:02,895 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 00:08:03,072 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 00:08:03,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:08:03,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:08:03,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:08:03,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:08:03,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:08:03,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:08:03,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:08:03,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:08:03,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2019-11-20 00:08:03,084 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:166, output treesize:63 [2019-11-20 00:08:03,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:08:03,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:08:03,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:08:03,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:08:03,255 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 00:08:03,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1197999187] [2019-11-20 00:08:03,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:08:03,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-11-20 00:08:03,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703898532] [2019-11-20 00:08:03,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 00:08:03,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:08:03,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 00:08:03,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-20 00:08:03,256 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand 16 states. [2019-11-20 00:08:04,841 WARN L191 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 42 [2019-11-20 00:08:05,208 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-11-20 00:08:06,441 WARN L191 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-11-20 00:08:07,994 WARN L191 SmtUtils]: Spent 997.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2019-11-20 00:08:09,544 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-11-20 00:08:10,915 WARN L191 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 51 [2019-11-20 00:08:11,494 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2019-11-20 00:08:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:08:11,569 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2019-11-20 00:08:11,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 00:08:11,569 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-11-20 00:08:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:08:11,570 INFO L225 Difference]: With dead ends: 106 [2019-11-20 00:08:11,570 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 00:08:11,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2019-11-20 00:08:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 00:08:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 80. [2019-11-20 00:08:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-20 00:08:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-11-20 00:08:11,574 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 18 [2019-11-20 00:08:11,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:08:11,575 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-11-20 00:08:11,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 00:08:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-11-20 00:08:11,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 00:08:11,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:08:11,576 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:08:11,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:08:11,776 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-20 00:08:11,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:08:11,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1094750862, now seen corresponding path program 1 times [2019-11-20 00:08:11,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:08:11,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [249627425] [2019-11-20 00:08:11,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a990d9-7c41-4b82-9b70-a671cb64be77/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 00:08:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:08:11,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 00:08:11,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:08:11,976 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 00:08:11,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:08:11,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:08:11,986 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 00:08:11,987 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:08:11,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:08:11,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:08:11,994 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 00:08:12,010 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 00:08:12,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:08:12,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:08:12,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:08:12,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-20 00:08:12,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:08:12,039 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 21 treesize of output 20 [2019-11-20 00:08:12,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:08:12,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:08:12,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:08:12,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-11-20 00:08:12,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:08:12,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:08:12,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:08:12,082 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 36 treesize of output 23 [2019-11-20 00:08:12,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:08:12,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:08:12,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:08:12,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:34 [2019-11-20 00:08:12,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:08:12,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:08:12,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:08:12,132 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 36 treesize of output 23 [2019-11-20 00:08:12,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:08:12,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:08:12,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:08:12,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:34 [2019-11-20 00:08:12,152 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 7 treesize of output 3 [2019-11-20 00:08:12,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:08:12,176 INFO L567 ElimStorePlain]: treesize reduction 7, result has 82.9 percent of original size [2019-11-20 00:08:12,177 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 00:08:12,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:34 [2019-11-20 00:08:12,303 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2019-11-20 00:08:12,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:08:12,364 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.1 percent of original size [2019-11-20 00:08:12,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:08:12,371 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:08:12,377 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:08:12,377 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2019-11-20 00:08:12,378 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:08:12,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:08:12,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:08:12,399 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:7 [2019-11-20 00:08:12,411 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 00:08:12,412 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:08:12,615 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 68 treesize of output 44 [2019-11-20 00:08:12,616 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:08:12,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:08:12,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:08:12,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:50 [2019-11-20 00:08:12,689 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:08:12,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:08:12,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 00:08:12,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:82 [2019-11-20 00:08:21,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:08:21,268 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 00:08:21,270 INFO L168 Benchmark]: Toolchain (without parser) took 57516.18 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.7 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -80.2 MB). Peak memory consumption was 194.5 MB. Max. memory is 11.5 GB. [2019-11-20 00:08:21,270 INFO L168 Benchmark]: CDTParser took 0.65 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:08:21,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 552.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -135.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:08:21,271 INFO L168 Benchmark]: Boogie Preprocessor took 82.93 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 00:08:21,271 INFO L168 Benchmark]: RCFGBuilder took 1071.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.2 MB). Peak memory consumption was 65.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:08:21,272 INFO L168 Benchmark]: TraceAbstraction took 55804.05 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 169.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -10.0 MB). Peak memory consumption was 159.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:08:21,273 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.65 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 552.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -135.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.93 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 1071.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.2 MB). Peak memory consumption was 65.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 55804.05 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 169.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -10.0 MB). Peak memory consumption was 159.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...