./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9c2b3b75-5069-4616-8e43-a5352819dbc8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9c2b3b75-5069-4616-8e43-a5352819dbc8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9c2b3b75-5069-4616-8e43-a5352819dbc8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9c2b3b75-5069-4616-8e43-a5352819dbc8/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9c2b3b75-5069-4616-8e43-a5352819dbc8/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9c2b3b75-5069-4616-8e43-a5352819dbc8/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adee0aad8018029b1a093d0ddfc0de44abfd0e03 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:16:48,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:16:48,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:16:48,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:16:48,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:16:48,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:16:48,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:16:48,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:16:48,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:16:48,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:16:48,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:16:48,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:16:48,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:16:48,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:16:48,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:16:48,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:16:48,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:16:48,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:16:48,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:16:48,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:16:48,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:16:48,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:16:48,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:16:48,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:16:48,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:16:48,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:16:48,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:16:48,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:16:48,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:16:48,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:16:48,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:16:48,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:16:48,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:16:48,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:16:48,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:16:48,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:16:48,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:16:48,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:16:48,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:16:48,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:16:48,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:16:48,507 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9c2b3b75-5069-4616-8e43-a5352819dbc8/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-12-07 17:16:48,516 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:16:48,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:16:48,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:16:48,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:16:48,517 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:16:48,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:16:48,518 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:16:48,518 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:16:48,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:16:48,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:16:48,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:16:48,518 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 17:16:48,518 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 17:16:48,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:16:48,519 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 17:16:48,519 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:16:48,519 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:16:48,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:16:48,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:16:48,519 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:16:48,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:16:48,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:16:48,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:16:48,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:16:48,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:16:48,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:16:48,520 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:16:48,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_9c2b3b75-5069-4616-8e43-a5352819dbc8/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-memcleanup) ) 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 -> adee0aad8018029b1a093d0ddfc0de44abfd0e03 [2019-12-07 17:16:48,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:16:48,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:16:48,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:16:48,647 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:16:48,648 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:16:48,648 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9c2b3b75-5069-4616-8e43-a5352819dbc8/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i [2019-12-07 17:16:48,687 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9c2b3b75-5069-4616-8e43-a5352819dbc8/bin/uautomizer/data/9ab14a1a2/ff94d41739cc46b8afb39de36e82a528/FLAG1a0618e8b [2019-12-07 17:16:49,069 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:16:49,069 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9c2b3b75-5069-4616-8e43-a5352819dbc8/sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i [2019-12-07 17:16:49,077 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9c2b3b75-5069-4616-8e43-a5352819dbc8/bin/uautomizer/data/9ab14a1a2/ff94d41739cc46b8afb39de36e82a528/FLAG1a0618e8b [2019-12-07 17:16:49,086 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9c2b3b75-5069-4616-8e43-a5352819dbc8/bin/uautomizer/data/9ab14a1a2/ff94d41739cc46b8afb39de36e82a528 [2019-12-07 17:16:49,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:16:49,088 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 17:16:49,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:16:49,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:16:49,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:16:49,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:16:49" (1/1) ... [2019-12-07 17:16:49,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cad387c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:49, skipping insertion in model container [2019-12-07 17:16:49,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:16:49" (1/1) ... [2019-12-07 17:16:49,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:16:49,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:16:49,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:16:49,338 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:16:49,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:16:49,399 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:16:49,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:49 WrapperNode [2019-12-07 17:16:49,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:16:49,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:16:49,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:16:49,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:16:49,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:49" (1/1) ... [2019-12-07 17:16:49,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:49" (1/1) ... [2019-12-07 17:16:49,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:49" (1/1) ... [2019-12-07 17:16:49,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:49" (1/1) ... [2019-12-07 17:16:49,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:49" (1/1) ... [2019-12-07 17:16:49,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:49" (1/1) ... [2019-12-07 17:16:49,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:49" (1/1) ... [2019-12-07 17:16:49,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:16:49,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:16:49,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:16:49,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:16:49,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2b3b75-5069-4616-8e43-a5352819dbc8/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:16:49,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 17:16:49,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:16:49,482 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 17:16:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 17:16:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 17:16:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 17:16:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 17:16:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 17:16:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 17:16:49,483 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 17:16:49,484 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 17:16:49,484 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 17:16:49,484 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 17:16:49,484 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 17:16:49,484 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 17:16:49,484 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 17:16:49,484 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 17:16:49,485 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 17:16:49,485 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 17:16:49,485 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 17:16:49,485 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 17:16:49,485 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 17:16:49,485 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 17:16:49,485 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 17:16:49,485 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 17:16:49,485 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 17:16:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 17:16:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 17:16:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 17:16:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 17:16:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 17:16:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 17:16:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 17:16:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 17:16:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 17:16:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 17:16:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 17:16:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 17:16:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 17:16:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 17:16:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 17:16:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 17:16:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 17:16:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 17:16:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 17:16:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 17:16:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 17:16:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 17:16:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 17:16:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 17:16:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 17:16:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 17:16:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 17:16:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 17:16:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 17:16:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 17:16:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 17:16:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 17:16:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 17:16:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 17:16:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 17:16:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 17:16:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 17:16:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 17:16:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 17:16:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 17:16:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 17:16:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 17:16:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 17:16:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 17:16:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 17:16:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 17:16:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 17:16:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 17:16:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 17:16:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 17:16:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 17:16:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 17:16:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 17:16:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 17:16:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 17:16:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 17:16:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 17:16:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 17:16:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 17:16:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 17:16:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 17:16:49,491 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 17:16:49,491 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 17:16:49,491 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 17:16:49,491 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 17:16:49,491 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 17:16:49,491 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 17:16:49,491 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 17:16:49,491 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 17:16:49,492 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 17:16:49,492 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 17:16:49,492 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 17:16:49,492 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 17:16:49,492 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 17:16:49,492 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 17:16:49,492 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 17:16:49,492 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 17:16:49,492 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 17:16:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 17:16:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 17:16:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 17:16:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 17:16:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 17:16:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:16:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:16:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:16:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:16:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 17:16:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:16:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 17:16:49,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:16:49,833 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:16:49,833 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:16:49,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:16:49 BoogieIcfgContainer [2019-12-07 17:16:49,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:16:49,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:16:49,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:16:49,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:16:49,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:16:49" (1/3) ... [2019-12-07 17:16:49,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2882e6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:16:49, skipping insertion in model container [2019-12-07 17:16:49,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:49" (2/3) ... [2019-12-07 17:16:49,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2882e6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:16:49, skipping insertion in model container [2019-12-07 17:16:49,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:16:49" (3/3) ... [2019-12-07 17:16:49,839 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-2.i [2019-12-07 17:16:49,845 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:16:49,850 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2019-12-07 17:16:49,858 INFO L249 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2019-12-07 17:16:49,870 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:16:49,870 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 17:16:49,870 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:16:49,870 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:16:49,871 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:16:49,871 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:16:49,871 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:16:49,871 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:16:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-12-07 17:16:49,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 17:16:49,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:49,889 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:49,889 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, 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, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_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-12-07 17:16:49,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:49,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1423383935, now seen corresponding path program 1 times [2019-12-07 17:16:49,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:49,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6696425] [2019-12-07 17:16:49,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:50,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6696425] [2019-12-07 17:16:50,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:50,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:16:50,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693609054] [2019-12-07 17:16:50,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:16:50,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:50,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:16:50,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:16:50,032 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 4 states. [2019-12-07 17:16:50,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:50,273 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2019-12-07 17:16:50,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:16:50,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 17:16:50,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:50,285 INFO L225 Difference]: With dead ends: 137 [2019-12-07 17:16:50,285 INFO L226 Difference]: Without dead ends: 133 [2019-12-07 17:16:50,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:16:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-07 17:16:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 104. [2019-12-07 17:16:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 17:16:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2019-12-07 17:16:50,319 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 7 [2019-12-07 17:16:50,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:50,319 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2019-12-07 17:16:50,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:16:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2019-12-07 17:16:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 17:16:50,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:50,319 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:50,320 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, 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, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_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-12-07 17:16:50,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:50,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1423383934, now seen corresponding path program 1 times [2019-12-07 17:16:50,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:50,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389163784] [2019-12-07 17:16:50,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:50,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389163784] [2019-12-07 17:16:50,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:50,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:16:50,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951839922] [2019-12-07 17:16:50,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:16:50,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:50,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:16:50,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:16:50,361 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 4 states. [2019-12-07 17:16:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:50,529 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2019-12-07 17:16:50,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:16:50,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 17:16:50,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:50,530 INFO L225 Difference]: With dead ends: 131 [2019-12-07 17:16:50,531 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 17:16:50,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:16:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 17:16:50,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 102. [2019-12-07 17:16:50,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 17:16:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2019-12-07 17:16:50,541 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 7 [2019-12-07 17:16:50,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:50,542 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2019-12-07 17:16:50,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:16:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2019-12-07 17:16:50,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 17:16:50,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:50,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:50,543 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, 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, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_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-12-07 17:16:50,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:50,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1881569075, now seen corresponding path program 1 times [2019-12-07 17:16:50,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:50,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235007929] [2019-12-07 17:16:50,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:50,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235007929] [2019-12-07 17:16:50,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:50,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:16:50,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384241694] [2019-12-07 17:16:50,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:16:50,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:50,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:16:50,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:16:50,606 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 5 states. [2019-12-07 17:16:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:50,759 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2019-12-07 17:16:50,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:16:50,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 17:16:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:50,760 INFO L225 Difference]: With dead ends: 105 [2019-12-07 17:16:50,760 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 17:16:50,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:16:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 17:16:50,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2019-12-07 17:16:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 17:16:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-12-07 17:16:50,769 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 12 [2019-12-07 17:16:50,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:50,769 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-12-07 17:16:50,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:16:50,769 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-12-07 17:16:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 17:16:50,770 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:50,770 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:50,770 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, 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, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_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-12-07 17:16:50,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:50,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1881569074, now seen corresponding path program 1 times [2019-12-07 17:16:50,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:50,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362464539] [2019-12-07 17:16:50,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:50,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362464539] [2019-12-07 17:16:50,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:50,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:16:50,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619953641] [2019-12-07 17:16:50,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:16:50,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:50,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:16:50,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:16:50,841 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 5 states. [2019-12-07 17:16:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:51,050 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-12-07 17:16:51,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:16:51,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 17:16:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:51,051 INFO L225 Difference]: With dead ends: 133 [2019-12-07 17:16:51,052 INFO L226 Difference]: Without dead ends: 133 [2019-12-07 17:16:51,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:16:51,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-07 17:16:51,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 112. [2019-12-07 17:16:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 17:16:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2019-12-07 17:16:51,059 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 12 [2019-12-07 17:16:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:51,059 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2019-12-07 17:16:51,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:16:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2019-12-07 17:16:51,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:16:51,060 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:51,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:51,061 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, 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, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_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-12-07 17:16:51,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:51,061 INFO L82 PathProgramCache]: Analyzing trace with hash -206140083, now seen corresponding path program 1 times [2019-12-07 17:16:51,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:51,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692023891] [2019-12-07 17:16:51,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:51,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692023891] [2019-12-07 17:16:51,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:51,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:16:51,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634124618] [2019-12-07 17:16:51,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:16:51,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:51,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:16:51,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:16:51,117 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 7 states. [2019-12-07 17:16:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:51,410 INFO L93 Difference]: Finished difference Result 188 states and 212 transitions. [2019-12-07 17:16:51,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:16:51,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-07 17:16:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:51,411 INFO L225 Difference]: With dead ends: 188 [2019-12-07 17:16:51,411 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 17:16:51,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:16:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 17:16:51,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 111. [2019-12-07 17:16:51,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 17:16:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2019-12-07 17:16:51,417 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 15 [2019-12-07 17:16:51,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:51,417 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2019-12-07 17:16:51,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:16:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2019-12-07 17:16:51,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:16:51,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:51,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:51,418 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, 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, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_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-12-07 17:16:51,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:51,418 INFO L82 PathProgramCache]: Analyzing trace with hash -206140082, now seen corresponding path program 1 times [2019-12-07 17:16:51,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:51,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874711323] [2019-12-07 17:16:51,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:51,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874711323] [2019-12-07 17:16:51,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:51,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:16:51,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951019059] [2019-12-07 17:16:51,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:16:51,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:51,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:16:51,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:16:51,479 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand 7 states. [2019-12-07 17:16:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:51,836 INFO L93 Difference]: Finished difference Result 197 states and 223 transitions. [2019-12-07 17:16:51,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:16:51,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-07 17:16:51,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:51,838 INFO L225 Difference]: With dead ends: 197 [2019-12-07 17:16:51,838 INFO L226 Difference]: Without dead ends: 197 [2019-12-07 17:16:51,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:16:51,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-07 17:16:51,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 103. [2019-12-07 17:16:51,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 17:16:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2019-12-07 17:16:51,842 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 15 [2019-12-07 17:16:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:51,842 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2019-12-07 17:16:51,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:16:51,843 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2019-12-07 17:16:51,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:16:51,843 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:51,843 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:51,843 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, 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, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_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-12-07 17:16:51,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:51,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1612763797, now seen corresponding path program 1 times [2019-12-07 17:16:51,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:51,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070117499] [2019-12-07 17:16:51,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:51,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070117499] [2019-12-07 17:16:51,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:51,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:16:51,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173339610] [2019-12-07 17:16:51,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:16:51,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:51,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:16:51,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:16:51,892 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 6 states. [2019-12-07 17:16:52,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:52,028 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2019-12-07 17:16:52,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:16:52,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-07 17:16:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:52,029 INFO L225 Difference]: With dead ends: 114 [2019-12-07 17:16:52,030 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 17:16:52,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:16:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 17:16:52,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2019-12-07 17:16:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 17:16:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2019-12-07 17:16:52,034 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 19 [2019-12-07 17:16:52,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:52,034 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2019-12-07 17:16:52,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:16:52,034 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2019-12-07 17:16:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:16:52,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:52,035 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-12-07 17:16:52,035 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, 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, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_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-12-07 17:16:52,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:52,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1494366199, now seen corresponding path program 1 times [2019-12-07 17:16:52,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:52,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007743279] [2019-12-07 17:16:52,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:52,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007743279] [2019-12-07 17:16:52,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:52,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:16:52,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922182294] [2019-12-07 17:16:52,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:16:52,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:52,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:16:52,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:16:52,072 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand 6 states. [2019-12-07 17:16:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:52,257 INFO L93 Difference]: Finished difference Result 144 states and 161 transitions. [2019-12-07 17:16:52,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:16:52,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 17:16:52,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:52,259 INFO L225 Difference]: With dead ends: 144 [2019-12-07 17:16:52,259 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 17:16:52,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:16:52,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 17:16:52,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 108. [2019-12-07 17:16:52,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 17:16:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2019-12-07 17:16:52,262 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 20 [2019-12-07 17:16:52,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:52,262 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2019-12-07 17:16:52,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:16:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2019-12-07 17:16:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:16:52,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:52,263 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-12-07 17:16:52,263 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, 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, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_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-12-07 17:16:52,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:52,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1494366200, now seen corresponding path program 1 times [2019-12-07 17:16:52,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:52,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124979438] [2019-12-07 17:16:52,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:52,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:52,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124979438] [2019-12-07 17:16:52,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:52,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:16:52,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621249] [2019-12-07 17:16:52,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:16:52,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:52,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:16:52,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:16:52,306 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 6 states. [2019-12-07 17:16:52,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:52,511 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2019-12-07 17:16:52,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:16:52,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 17:16:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:52,512 INFO L225 Difference]: With dead ends: 153 [2019-12-07 17:16:52,512 INFO L226 Difference]: Without dead ends: 153 [2019-12-07 17:16:52,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:16:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-12-07 17:16:52,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 107. [2019-12-07 17:16:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 17:16:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2019-12-07 17:16:52,517 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 20 [2019-12-07 17:16:52,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:52,518 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2019-12-07 17:16:52,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:16:52,518 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2019-12-07 17:16:52,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:16:52,519 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:52,519 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, 1, 1] [2019-12-07 17:16:52,519 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, 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, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_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-12-07 17:16:52,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:52,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1231522178, now seen corresponding path program 1 times [2019-12-07 17:16:52,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:52,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773660275] [2019-12-07 17:16:52,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:52,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773660275] [2019-12-07 17:16:52,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206251068] [2019-12-07 17:16:52,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2b3b75-5069-4616-8e43-a5352819dbc8/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:52,675 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 17:16:52,680 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:16:52,740 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:52,740 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 12 treesize of output 28 [2019-12-07 17:16:52,741 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:52,751 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 17:16:52,751 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:52,751 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 17:16:52,764 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-12-07 17:16:52,764 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:52,768 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:52,769 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:52,769 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2019-12-07 17:16:52,798 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-12-07 17:16:52,798 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:52,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:52,803 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:16:52,804 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2019-12-07 17:16:52,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:52,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:16:52,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-12-07 17:16:52,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71915608] [2019-12-07 17:16:52,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:16:52,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:52,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:16:52,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:16:52,815 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 12 states. [2019-12-07 17:16:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:53,081 INFO L93 Difference]: Finished difference Result 149 states and 164 transitions. [2019-12-07 17:16:53,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:16:53,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-12-07 17:16:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:53,082 INFO L225 Difference]: With dead ends: 149 [2019-12-07 17:16:53,082 INFO L226 Difference]: Without dead ends: 149 [2019-12-07 17:16:53,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:16:53,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-12-07 17:16:53,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 110. [2019-12-07 17:16:53,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 17:16:53,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2019-12-07 17:16:53,086 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 22 [2019-12-07 17:16:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:53,086 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2019-12-07 17:16:53,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:16:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2019-12-07 17:16:53,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:16:53,086 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:53,087 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, 1, 1] [2019-12-07 17:16:53,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:53,288 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, 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, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_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-12-07 17:16:53,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:53,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1231522177, now seen corresponding path program 1 times [2019-12-07 17:16:53,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:53,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612995253] [2019-12-07 17:16:53,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:53,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:53,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612995253] [2019-12-07 17:16:53,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111625009] [2019-12-07 17:16:53,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9c2b3b75-5069-4616-8e43-a5352819dbc8/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:53,484 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 17:16:53,486 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:16:53,489 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-12-07 17:16:53,489 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:53,491 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:53,491 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:53,491 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:16:53,519 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:53,520 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 19 treesize of output 33 [2019-12-07 17:16:53,521 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:53,534 INFO L614 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2019-12-07 17:16:53,534 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:53,535 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2019-12-07 17:16:53,554 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-12-07 17:16:53,554 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:53,562 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:53,565 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-12-07 17:16:53,565 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:53,573 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:53,574 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:53,574 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:31 [2019-12-07 17:16:53,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 17 treesize of output 9 [2019-12-07 17:16:53,615 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:53,622 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:53,623 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 24 treesize of output 12 [2019-12-07 17:16:53,624 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:53,628 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:53,629 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:16:53,629 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:19 [2019-12-07 17:16:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:53,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:16:53,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-07 17:16:53,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866828698] [2019-12-07 17:16:53,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:16:53,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:53,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:16:53,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:16:53,667 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 16 states. [2019-12-07 17:16:54,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:54,859 INFO L93 Difference]: Finished difference Result 173 states and 188 transitions. [2019-12-07 17:16:54,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:16:54,860 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 17:16:54,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:54,864 INFO L225 Difference]: With dead ends: 173 [2019-12-07 17:16:54,864 INFO L226 Difference]: Without dead ends: 173 [2019-12-07 17:16:54,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:16:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-12-07 17:16:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 109. [2019-12-07 17:16:54,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 17:16:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2019-12-07 17:16:54,873 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 22 [2019-12-07 17:16:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:54,873 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2019-12-07 17:16:54,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:16:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2019-12-07 17:16:54,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:16:54,874 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:54,875 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, 1, 1, 1] [2019-12-07 17:16:55,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:55,076 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, 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, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_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-12-07 17:16:55,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:55,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1327467012, now seen corresponding path program 1 times [2019-12-07 17:16:55,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:55,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92925996] [2019-12-07 17:16:55,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:55,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92925996] [2019-12-07 17:16:55,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:55,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:16:55,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485470241] [2019-12-07 17:16:55,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:16:55,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:55,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:16:55,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:16:55,155 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 10 states. [2019-12-07 17:16:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:55,446 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2019-12-07 17:16:55,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:16:55,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-12-07 17:16:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:55,448 INFO L225 Difference]: With dead ends: 115 [2019-12-07 17:16:55,448 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 17:16:55,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:16:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 17:16:55,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 108. [2019-12-07 17:16:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 17:16:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-12-07 17:16:55,452 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 23 [2019-12-07 17:16:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:55,452 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-12-07 17:16:55,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:16:55,452 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-12-07 17:16:55,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:16:55,453 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:55,453 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, 1, 1, 1] [2019-12-07 17:16:55,453 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, 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, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_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-12-07 17:16:55,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:55,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1327467013, now seen corresponding path program 1 times [2019-12-07 17:16:55,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:55,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104695871] [2019-12-07 17:16:55,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:55,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104695871] [2019-12-07 17:16:55,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:55,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:16:55,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416420533] [2019-12-07 17:16:55,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:16:55,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:55,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:16:55,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:16:55,540 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 10 states. [2019-12-07 17:16:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:55,844 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2019-12-07 17:16:55,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:16:55,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-12-07 17:16:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:55,845 INFO L225 Difference]: With dead ends: 114 [2019-12-07 17:16:55,845 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 17:16:55,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:16:55,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 17:16:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2019-12-07 17:16:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 17:16:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2019-12-07 17:16:55,847 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 23 [2019-12-07 17:16:55,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:55,847 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2019-12-07 17:16:55,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:16:55,848 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2019-12-07 17:16:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:16:55,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:55,848 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, 1, 1, 1] [2019-12-07 17:16:55,848 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, 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, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_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-12-07 17:16:55,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:55,849 INFO L82 PathProgramCache]: Analyzing trace with hash 475887303, now seen corresponding path program 1 times [2019-12-07 17:16:55,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:55,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301251876] [2019-12-07 17:16:55,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:55,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301251876] [2019-12-07 17:16:55,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:55,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:16:55,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149441715] [2019-12-07 17:16:55,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:16:55,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:55,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:16:55,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:16:55,908 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 9 states. [2019-12-07 17:16:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:56,147 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2019-12-07 17:16:56,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:16:56,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-07 17:16:56,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:56,149 INFO L225 Difference]: With dead ends: 151 [2019-12-07 17:16:56,149 INFO L226 Difference]: Without dead ends: 151 [2019-12-07 17:16:56,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:16:56,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-12-07 17:16:56,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 111. [2019-12-07 17:16:56,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 17:16:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2019-12-07 17:16:56,152 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 23 [2019-12-07 17:16:56,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:56,152 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2019-12-07 17:16:56,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:16:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2019-12-07 17:16:56,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:16:56,153 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:56,154 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, 1, 1, 1] [2019-12-07 17:16:56,154 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, 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, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_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-12-07 17:16:56,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:56,154 INFO L82 PathProgramCache]: Analyzing trace with hash 475887304, now seen corresponding path program 1 times [2019-12-07 17:16:56,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:56,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326989451] [2019-12-07 17:16:56,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:56,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326989451] [2019-12-07 17:16:56,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:56,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:16:56,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84826238] [2019-12-07 17:16:56,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:16:56,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:56,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:16:56,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:16:56,235 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand 9 states. [2019-12-07 17:16:57,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:57,052 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2019-12-07 17:16:57,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:16:57,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-07 17:16:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:57,055 INFO L225 Difference]: With dead ends: 175 [2019-12-07 17:16:57,055 INFO L226 Difference]: Without dead ends: 175 [2019-12-07 17:16:57,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:16:57,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-12-07 17:16:57,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 113. [2019-12-07 17:16:57,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 17:16:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2019-12-07 17:16:57,061 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 23 [2019-12-07 17:16:57,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:57,061 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2019-12-07 17:16:57,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:16:57,061 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2019-12-07 17:16:57,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:16:57,062 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:57,062 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, 1, 1, 1, 1, 1] [2019-12-07 17:16:57,063 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, 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, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_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-12-07 17:16:57,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:57,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2061168108, now seen corresponding path program 1 times [2019-12-07 17:16:57,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:57,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505033588] [2019-12-07 17:16:57,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:16:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:16:57,099 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:16:57,099 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:16:57,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:16:57 BoogieIcfgContainer [2019-12-07 17:16:57,118 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:16:57,118 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:16:57,118 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:16:57,118 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:16:57,119 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:16:49" (3/4) ... [2019-12-07 17:16:57,120 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:16:57,148 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9c2b3b75-5069-4616-8e43-a5352819dbc8/bin/uautomizer/witness.graphml [2019-12-07 17:16:57,148 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:16:57,149 INFO L168 Benchmark]: Toolchain (without parser) took 8061.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 942.0 MB in the beginning and 982.1 MB in the end (delta: -40.1 MB). Peak memory consumption was 120.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:16:57,150 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 964.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:16:57,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -127.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:16:57,150 INFO L168 Benchmark]: Boogie Preprocessor took 40.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:16:57,150 INFO L168 Benchmark]: RCFGBuilder took 392.58 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: 60.2 MB). Peak memory consumption was 60.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:16:57,151 INFO L168 Benchmark]: TraceAbstraction took 7283.59 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.0 GB in the beginning and 984.5 MB in the end (delta: 19.0 MB). Peak memory consumption was 96.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:16:57,151 INFO L168 Benchmark]: Witness Printer took 30.32 ms. Allocated memory is still 1.2 GB. Free memory was 984.5 MB in the beginning and 982.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:16:57,152 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 964.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -127.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 392.58 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: 60.2 MB). Peak memory consumption was 60.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7283.59 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.0 GB in the beginning and 984.5 MB in the end (delta: 19.0 MB). Peak memory consumption was 96.1 MB. Max. memory is 11.5 GB. * Witness Printer took 30.32 ms. Allocated memory is still 1.2 GB. Free memory was 984.5 MB in the beginning and 982.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1042]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L988] SLL* head = malloc(sizeof(SLL)); VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L989] head->next = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L990] head->data = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L992] SLL* x = head; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND TRUE __VERIFIER_nondet_int() [L1006] x = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}] [L1007] x->data = 1 VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}] [L1008] x->next = head VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}] [L1009] head = x VAL [head={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}] [L1029] x = head VAL [head={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}] [L1032] EXPR x->data VAL [head={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}, x->data=1] [L1032] COND FALSE !(x->data != 1) [L1038] EXPR x->next VAL [head={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}, x->next={-1:0}] [L1038] x = x->next [L1039] COND TRUE \read(*x) VAL [head={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L1041] EXPR x->data VAL [head={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}, x->data=0] [L1041] COND TRUE x->data != 1 [L1042] __VERIFIER_error() VAL [head={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 110 locations, 49 error locations. Result: UNSAFE, OverallTime: 7.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 954 SDtfs, 2245 SDslu, 1922 SDs, 0 SdLazy, 5698 SolverSat, 379 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 564 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 38655 SizeOfPredicates, 21 NumberOfNonLiveVariables, 246 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 1/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...