./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-properties/alternating_list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/alternating_list-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/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 9c54128245d3ab9ad313da188c7be33f66027c6a .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:59:14,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:59:14,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:59:14,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:59:14,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:59:14,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:59:14,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:59:14,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:59:14,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:59:14,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:59:14,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:59:14,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:59:14,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:59:14,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:59:14,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:59:14,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:59:14,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:59:14,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:59:14,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:59:14,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:59:14,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:59:14,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:59:14,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:59:14,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:59:14,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:59:14,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:59:14,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:59:14,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:59:14,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:59:14,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:59:14,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:59:14,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:59:14,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:59:14,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:59:14,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:59:14,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:59:14,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:59:14,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:59:14,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:59:14,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:59:14,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:59:14,916 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-15 22:59:14,930 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:59:14,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:59:14,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:59:14,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:59:14,932 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:59:14,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:59:14,933 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:59:14,933 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:59:14,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:59:14,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:59:14,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:59:14,934 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:59:14,934 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:59:14,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:59:14,935 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:59:14,935 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:59:14,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:59:14,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:59:14,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:59:14,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:59:14,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:59:14,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:59:14,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:59:14,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:59:14,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:59:14,938 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_a49dc9d9-2120-4591-b32f-3c78b9381d94/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 -> 9c54128245d3ab9ad313da188c7be33f66027c6a [2019-11-15 22:59:14,965 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:59:14,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:59:14,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:59:14,979 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:59:14,980 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:59:14,980 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/bin/uautomizer/../../sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-15 22:59:15,031 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/bin/uautomizer/data/b63331e93/c3494a813c874796b59579b38f821162/FLAG160f44e23 [2019-11-15 22:59:15,517 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:59:15,517 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-15 22:59:15,531 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/bin/uautomizer/data/b63331e93/c3494a813c874796b59579b38f821162/FLAG160f44e23 [2019-11-15 22:59:15,545 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/bin/uautomizer/data/b63331e93/c3494a813c874796b59579b38f821162 [2019-11-15 22:59:15,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:59:15,548 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:59:15,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:59:15,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:59:15,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:59:15,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:59:15" (1/1) ... [2019-11-15 22:59:15,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f8221fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:15, skipping insertion in model container [2019-11-15 22:59:15,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:59:15" (1/1) ... [2019-11-15 22:59:15,562 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:59:15,594 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:59:15,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:59:15,987 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:59:16,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:59:16,094 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:59:16,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:16 WrapperNode [2019-11-15 22:59:16,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:59:16,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:59:16,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:59:16,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:59:16,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:16" (1/1) ... [2019-11-15 22:59:16,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:16" (1/1) ... [2019-11-15 22:59:16,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:16" (1/1) ... [2019-11-15 22:59:16,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:16" (1/1) ... [2019-11-15 22:59:16,142 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:16" (1/1) ... [2019-11-15 22:59:16,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:16" (1/1) ... [2019-11-15 22:59:16,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:16" (1/1) ... [2019-11-15 22:59:16,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:59:16,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:59:16,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:59:16,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:59:16,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:59:16,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:59:16,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:59:16,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 22:59:16,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 22:59:16,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 22:59:16,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 22:59:16,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 22:59:16,231 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 22:59:16,231 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:59:16,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:59:16,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 22:59:16,232 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:59:16,232 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:59:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:59:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:59:16,233 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:59:16,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:59:16,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:59:16,234 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:59:16,236 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:59:16,236 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:59:16,237 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:59:16,237 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:59:16,237 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:59:16,237 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:59:16,237 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:59:16,237 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:59:16,237 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 22:59:16,237 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 22:59:16,238 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 22:59:16,238 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 22:59:16,238 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 22:59:16,238 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:59:16,238 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:59:16,239 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:59:16,239 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:59:16,239 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:59:16,239 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:59:16,239 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:59:16,239 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:59:16,239 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:59:16,239 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:59:16,240 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:59:16,240 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:59:16,240 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:59:16,240 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:59:16,240 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:59:16,240 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:59:16,240 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:59:16,240 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:59:16,241 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:59:16,241 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:59:16,241 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:59:16,241 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:59:16,241 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:59:16,241 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:59:16,241 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:59:16,241 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:59:16,242 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:59:16,242 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:59:16,242 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:59:16,242 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:59:16,242 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:59:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:59:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:59:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:59:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:59:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:59:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:59:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:59:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:59:16,244 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:59:16,244 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:59:16,245 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:59:16,245 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:59:16,245 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:59:16,246 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:59:16,246 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:59:16,247 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:59:16,247 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:59:16,247 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:59:16,247 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:59:16,248 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:59:16,248 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:59:16,248 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:59:16,248 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:59:16,248 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:59:16,249 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:59:16,249 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:59:16,249 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:59:16,249 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:59:16,249 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:59:16,250 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:59:16,250 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:59:16,250 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:59:16,250 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:59:16,250 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:59:16,250 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:59:16,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:59:16,250 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:59:16,251 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:59:16,251 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:59:16,251 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:59:16,251 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:59:16,251 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:59:16,251 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:59:16,251 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:59:16,251 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:59:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:59:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:59:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:59:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:59:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:59:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:59:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:59:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:59:16,252 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:59:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:59:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 22:59:16,253 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:59:16,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:59:16,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:59:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:59:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:59:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:59:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:59:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:59:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:59:16,666 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 22:59:16,957 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:59:16,957 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-15 22:59:16,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:59:16 BoogieIcfgContainer [2019-11-15 22:59:16,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:59:16,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:59:16,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:59:16,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:59:16,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:59:15" (1/3) ... [2019-11-15 22:59:16,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2568ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:59:16, skipping insertion in model container [2019-11-15 22:59:16,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:59:16" (2/3) ... [2019-11-15 22:59:16,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2568ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:59:16, skipping insertion in model container [2019-11-15 22:59:16,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:59:16" (3/3) ... [2019-11-15 22:59:16,964 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2019-11-15 22:59:16,973 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:59:16,978 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-15 22:59:16,988 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-15 22:59:17,005 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:59:17,006 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:59:17,006 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:59:17,006 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:59:17,006 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:59:17,006 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:59:17,006 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:59:17,006 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:59:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-15 22:59:17,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:59:17,031 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:17,031 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:17,033 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-15 22:59:17,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:17,037 INFO L82 PathProgramCache]: Analyzing trace with hash 63975510, now seen corresponding path program 1 times [2019-11-15 22:59:17,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:17,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126447026] [2019-11-15 22:59:17,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:17,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:17,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:17,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126447026] [2019-11-15 22:59:17,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:17,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:59:17,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156808836] [2019-11-15 22:59:17,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:59:17,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:17,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:59:17,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:59:17,229 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2019-11-15 22:59:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:17,510 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-11-15 22:59:17,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:59:17,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-15 22:59:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:17,521 INFO L225 Difference]: With dead ends: 80 [2019-11-15 22:59:17,522 INFO L226 Difference]: Without dead ends: 72 [2019-11-15 22:59:17,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:59:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-15 22:59:17,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-11-15 22:59:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-15 22:59:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-11-15 22:59:17,585 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 10 [2019-11-15 22:59:17,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:17,585 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-11-15 22:59:17,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:59:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-11-15 22:59:17,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 22:59:17,586 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:17,587 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:17,587 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-15 22:59:17,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:17,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1983205163, now seen corresponding path program 1 times [2019-11-15 22:59:17,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:17,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266682557] [2019-11-15 22:59:17,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:17,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:17,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:17,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266682557] [2019-11-15 22:59:17,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:17,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:59:17,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973488792] [2019-11-15 22:59:17,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:59:17,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:17,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:59:17,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:59:17,688 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 5 states. [2019-11-15 22:59:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:17,965 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-11-15 22:59:17,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:59:17,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-15 22:59:17,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:17,967 INFO L225 Difference]: With dead ends: 93 [2019-11-15 22:59:17,968 INFO L226 Difference]: Without dead ends: 93 [2019-11-15 22:59:17,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-15 22:59:17,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-15 22:59:17,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2019-11-15 22:59:17,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-15 22:59:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2019-11-15 22:59:17,987 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 11 [2019-11-15 22:59:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:17,988 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2019-11-15 22:59:17,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:59:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2019-11-15 22:59:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 22:59:17,988 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:17,988 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:17,989 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-15 22:59:17,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:17,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1983205164, now seen corresponding path program 1 times [2019-11-15 22:59:17,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:17,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897759929] [2019-11-15 22:59:17,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:17,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:17,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:18,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897759929] [2019-11-15 22:59:18,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:18,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:59:18,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893968582] [2019-11-15 22:59:18,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:59:18,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:18,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:59:18,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:59:18,110 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 5 states. [2019-11-15 22:59:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:18,387 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-15 22:59:18,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:59:18,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-15 22:59:18,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:18,389 INFO L225 Difference]: With dead ends: 99 [2019-11-15 22:59:18,389 INFO L226 Difference]: Without dead ends: 99 [2019-11-15 22:59:18,390 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-15 22:59:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-15 22:59:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2019-11-15 22:59:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 22:59:18,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2019-11-15 22:59:18,399 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 11 [2019-11-15 22:59:18,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:18,400 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2019-11-15 22:59:18,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:59:18,400 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2019-11-15 22:59:18,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 22:59:18,401 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:18,401 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:18,402 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-15 22:59:18,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:18,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2096806293, now seen corresponding path program 1 times [2019-11-15 22:59:18,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:18,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576270770] [2019-11-15 22:59:18,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:18,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:18,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:18,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576270770] [2019-11-15 22:59:18,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:18,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:59:18,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639006722] [2019-11-15 22:59:18,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:59:18,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:18,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:59:18,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:59:18,500 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 5 states. [2019-11-15 22:59:18,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:18,707 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2019-11-15 22:59:18,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:59:18,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-15 22:59:18,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:18,709 INFO L225 Difference]: With dead ends: 95 [2019-11-15 22:59:18,709 INFO L226 Difference]: Without dead ends: 95 [2019-11-15 22:59:18,710 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-15 22:59:18,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-15 22:59:18,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2019-11-15 22:59:18,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-15 22:59:18,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-11-15 22:59:18,719 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 19 [2019-11-15 22:59:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:18,719 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-11-15 22:59:18,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:59:18,720 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-11-15 22:59:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 22:59:18,721 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:18,721 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:18,721 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-15 22:59:18,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:18,722 INFO L82 PathProgramCache]: Analyzing trace with hash 576531525, now seen corresponding path program 1 times [2019-11-15 22:59:18,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:18,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117512924] [2019-11-15 22:59:18,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:18,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:18,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:18,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:18,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117512924] [2019-11-15 22:59:18,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:18,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:59:18,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391308086] [2019-11-15 22:59:18,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:59:18,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:18,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:59:18,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:59:18,844 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 6 states. [2019-11-15 22:59:19,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:19,081 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-15 22:59:19,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:59:19,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-15 22:59:19,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:19,082 INFO L225 Difference]: With dead ends: 99 [2019-11-15 22:59:19,083 INFO L226 Difference]: Without dead ends: 99 [2019-11-15 22:59:19,083 INFO L600 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-11-15 22:59:19,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-15 22:59:19,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2019-11-15 22:59:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-15 22:59:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2019-11-15 22:59:19,089 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 20 [2019-11-15 22:59:19,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:19,089 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2019-11-15 22:59:19,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:59:19,089 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2019-11-15 22:59:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 22:59:19,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:19,090 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:19,091 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-15 22:59:19,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:19,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1548979245, now seen corresponding path program 1 times [2019-11-15 22:59:19,091 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:19,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888425118] [2019-11-15 22:59:19,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:19,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:19,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:19,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888425118] [2019-11-15 22:59:19,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:19,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:59:19,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368285924] [2019-11-15 22:59:19,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:59:19,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:19,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:59:19,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:59:19,217 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 7 states. [2019-11-15 22:59:19,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:19,461 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2019-11-15 22:59:19,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:59:19,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-15 22:59:19,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:19,462 INFO L225 Difference]: With dead ends: 132 [2019-11-15 22:59:19,462 INFO L226 Difference]: Without dead ends: 132 [2019-11-15 22:59:19,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:59:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-15 22:59:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 95. [2019-11-15 22:59:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-15 22:59:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2019-11-15 22:59:19,468 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 20 [2019-11-15 22:59:19,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:19,468 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2019-11-15 22:59:19,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:59:19,468 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2019-11-15 22:59:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:59:19,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:19,469 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:19,470 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-15 22:59:19,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:19,470 INFO L82 PathProgramCache]: Analyzing trace with hash 691191193, now seen corresponding path program 1 times [2019-11-15 22:59:19,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:19,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531923581] [2019-11-15 22:59:19,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:19,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:19,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:19,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:19,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531923581] [2019-11-15 22:59:19,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:19,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:59:19,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075337541] [2019-11-15 22:59:19,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:59:19,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:19,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:59:19,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:59:19,548 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 6 states. [2019-11-15 22:59:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:19,740 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-15 22:59:19,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:59:19,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-15 22:59:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:19,742 INFO L225 Difference]: With dead ends: 109 [2019-11-15 22:59:19,742 INFO L226 Difference]: Without dead ends: 105 [2019-11-15 22:59:19,742 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:59:19,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-15 22:59:19,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2019-11-15 22:59:19,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-15 22:59:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2019-11-15 22:59:19,749 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 21 [2019-11-15 22:59:19,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:19,749 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2019-11-15 22:59:19,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:59:19,749 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2019-11-15 22:59:19,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:59:19,750 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:19,750 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:19,751 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-15 22:59:19,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:19,751 INFO L82 PathProgramCache]: Analyzing trace with hash 692608250, now seen corresponding path program 1 times [2019-11-15 22:59:19,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:19,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172598878] [2019-11-15 22:59:19,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:19,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:19,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:19,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172598878] [2019-11-15 22:59:19,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:19,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:59:19,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578257979] [2019-11-15 22:59:19,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:59:19,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:19,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:59:19,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:59:19,846 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 8 states. [2019-11-15 22:59:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:20,173 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-11-15 22:59:20,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:59:20,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-15 22:59:20,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:20,174 INFO L225 Difference]: With dead ends: 111 [2019-11-15 22:59:20,175 INFO L226 Difference]: Without dead ends: 104 [2019-11-15 22:59:20,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:59:20,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-15 22:59:20,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2019-11-15 22:59:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-15 22:59:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-11-15 22:59:20,182 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 21 [2019-11-15 22:59:20,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:20,183 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-11-15 22:59:20,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:59:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-11-15 22:59:20,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:59:20,184 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:20,184 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:20,184 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-15 22:59:20,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:20,184 INFO L82 PathProgramCache]: Analyzing trace with hash -972300712, now seen corresponding path program 1 times [2019-11-15 22:59:20,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:20,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273922981] [2019-11-15 22:59:20,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:20,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:20,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:20,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:20,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273922981] [2019-11-15 22:59:20,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:20,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:59:20,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33509525] [2019-11-15 22:59:20,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:59:20,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:20,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:59:20,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:59:20,254 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 7 states. [2019-11-15 22:59:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:20,488 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-15 22:59:20,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:59:20,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-15 22:59:20,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:20,489 INFO L225 Difference]: With dead ends: 96 [2019-11-15 22:59:20,489 INFO L226 Difference]: Without dead ends: 96 [2019-11-15 22:59:20,490 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:59:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-15 22:59:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-11-15 22:59:20,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-15 22:59:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2019-11-15 22:59:20,495 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 21 [2019-11-15 22:59:20,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:20,495 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2019-11-15 22:59:20,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:59:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2019-11-15 22:59:20,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:59:20,496 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:20,496 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:20,497 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-15 22:59:20,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:20,497 INFO L82 PathProgramCache]: Analyzing trace with hash -972300711, now seen corresponding path program 1 times [2019-11-15 22:59:20,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:20,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149939012] [2019-11-15 22:59:20,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:20,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:20,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:20,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149939012] [2019-11-15 22:59:20,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:20,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:59:20,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199632609] [2019-11-15 22:59:20,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:59:20,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:20,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:59:20,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:59:20,598 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 7 states. [2019-11-15 22:59:20,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:20,914 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2019-11-15 22:59:20,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:59:20,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-15 22:59:20,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:20,915 INFO L225 Difference]: With dead ends: 87 [2019-11-15 22:59:20,915 INFO L226 Difference]: Without dead ends: 87 [2019-11-15 22:59:20,916 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:59:20,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-15 22:59:20,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2019-11-15 22:59:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-15 22:59:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-11-15 22:59:20,920 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 21 [2019-11-15 22:59:20,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:20,920 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-11-15 22:59:20,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:59:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-11-15 22:59:20,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:59:20,921 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:20,921 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:20,922 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-15 22:59:20,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:20,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1951842208, now seen corresponding path program 1 times [2019-11-15 22:59:20,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:20,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123917575] [2019-11-15 22:59:20,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:20,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:20,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:21,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123917575] [2019-11-15 22:59:21,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441380239] [2019-11-15 22:59:21,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:21,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 22:59:21,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:21,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:59:21,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:21,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:21,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:21,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 22:59:21,507 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:21,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 22:59:21,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:21,558 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 22:59:21,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:21,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 22:59:21,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:59:21,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:21,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:21,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:21,641 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:39 [2019-11-15 22:59:21,852 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:21,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 67 [2019-11-15 22:59:21,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:59:21,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:59:21,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:59:21,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 22:59:21,922 INFO L567 ElimStorePlain]: treesize reduction 70, result has 34.6 percent of original size [2019-11-15 22:59:21,923 INFO L496 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-11-15 22:59:21,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:36 [2019-11-15 22:59:22,091 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:59:22,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-15 22:59:22,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:22,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:22,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:59:22,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:15 [2019-11-15 22:59:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:22,196 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:59:22,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-15 22:59:22,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533925100] [2019-11-15 22:59:22,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 22:59:22,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:22,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 22:59:22,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2019-11-15 22:59:22,199 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 26 states. [2019-11-15 22:59:24,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:24,388 INFO L93 Difference]: Finished difference Result 217 states and 229 transitions. [2019-11-15 22:59:24,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-15 22:59:24,388 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 30 [2019-11-15 22:59:24,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:24,391 INFO L225 Difference]: With dead ends: 217 [2019-11-15 22:59:24,391 INFO L226 Difference]: Without dead ends: 214 [2019-11-15 22:59:24,392 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=467, Invalid=2395, Unknown=0, NotChecked=0, Total=2862 [2019-11-15 22:59:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-15 22:59:24,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 102. [2019-11-15 22:59:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-15 22:59:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2019-11-15 22:59:24,410 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 30 [2019-11-15 22:59:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:24,410 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2019-11-15 22:59:24,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 22:59:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2019-11-15 22:59:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 22:59:24,413 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:24,413 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:24,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:24,619 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-15 22:59:24,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:24,619 INFO L82 PathProgramCache]: Analyzing trace with hash 295041158, now seen corresponding path program 1 times [2019-11-15 22:59:24,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:24,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504100446] [2019-11-15 22:59:24,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:24,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:24,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:24,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504100446] [2019-11-15 22:59:24,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732660565] [2019-11-15 22:59:24,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:24,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-15 22:59:24,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:24,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:59:24,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:24,979 INFO L567 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2019-11-15 22:59:24,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:24,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-11-15 22:59:25,014 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:25,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:59:25,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:25,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:25,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:25,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-15 22:59:25,048 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_16|], 2=[|v_#memory_int_16|]} [2019-11-15 22:59:25,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:59:25,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:25,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:25,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:59:25,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 22:59:25,084 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:25,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:25,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:25,095 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-11-15 22:59:25,123 INFO L375 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 20 treesize of output 8 [2019-11-15 22:59:25,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:25,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:25,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:25,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-11-15 22:59:25,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:59:25,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:25,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:25,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:59:25,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-11-15 22:59:25,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:59:25,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:25,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:25,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:25,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-15 22:59:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:25,306 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:59:25,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-11-15 22:59:25,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501320567] [2019-11-15 22:59:25,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-15 22:59:25,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:25,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 22:59:25,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:59:25,308 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand 24 states. [2019-11-15 22:59:26,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:26,067 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2019-11-15 22:59:26,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 22:59:26,068 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2019-11-15 22:59:26,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:26,069 INFO L225 Difference]: With dead ends: 175 [2019-11-15 22:59:26,069 INFO L226 Difference]: Without dead ends: 171 [2019-11-15 22:59:26,070 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 22:59:26,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-15 22:59:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 98. [2019-11-15 22:59:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-15 22:59:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-11-15 22:59:26,074 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 31 [2019-11-15 22:59:26,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:26,074 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-11-15 22:59:26,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-15 22:59:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-11-15 22:59:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 22:59:26,076 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:26,076 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:26,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:26,280 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-15 22:59:26,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:26,280 INFO L82 PathProgramCache]: Analyzing trace with hash 384991059, now seen corresponding path program 2 times [2019-11-15 22:59:26,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:26,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314902845] [2019-11-15 22:59:26,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:26,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:26,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:59:26,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314902845] [2019-11-15 22:59:26,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:26,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:59:26,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120600848] [2019-11-15 22:59:26,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:59:26,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:26,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:59:26,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:59:26,330 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 4 states. [2019-11-15 22:59:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:26,452 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2019-11-15 22:59:26,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:59:26,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-11-15 22:59:26,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:26,454 INFO L225 Difference]: With dead ends: 131 [2019-11-15 22:59:26,454 INFO L226 Difference]: Without dead ends: 131 [2019-11-15 22:59:26,455 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-15 22:59:26,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-15 22:59:26,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 98. [2019-11-15 22:59:26,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-15 22:59:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2019-11-15 22:59:26,459 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 40 [2019-11-15 22:59:26,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:26,459 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2019-11-15 22:59:26,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:59:26,459 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2019-11-15 22:59:26,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 22:59:26,461 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:26,461 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:26,461 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-15 22:59:26,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:26,462 INFO L82 PathProgramCache]: Analyzing trace with hash -232317747, now seen corresponding path program 1 times [2019-11-15 22:59:26,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:26,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728615276] [2019-11-15 22:59:26,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:26,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:26,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:26,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728615276] [2019-11-15 22:59:26,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711559109] [2019-11-15 22:59:26,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:26,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-15 22:59:26,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:26,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:59:26,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:26,985 INFO L567 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2019-11-15 22:59:26,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:26,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-11-15 22:59:27,042 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:27,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:59:27,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:27,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:27,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:27,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-15 22:59:27,079 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_17|], 2=[|v_#memory_int_19|]} [2019-11-15 22:59:27,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:59:27,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:27,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:27,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:59:27,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 22:59:27,108 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:27,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:27,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:27,130 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-11-15 22:59:27,169 INFO L375 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 20 treesize of output 8 [2019-11-15 22:59:27,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:27,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:27,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:27,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-11-15 22:59:27,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:59:27,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:27,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:27,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:27,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 22:59:27,284 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_14|], 6=[|v_#memory_int_21|]} [2019-11-15 22:59:27,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:59:27,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:27,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:27,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:59:27,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 22:59:27,319 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:27,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:27,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:27,330 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:31 [2019-11-15 22:59:27,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-15 22:59:27,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:27,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:27,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:59:27,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:25 [2019-11-15 22:59:27,505 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:27,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-15 22:59:27,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:27,541 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-15 22:59:27,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:59:27,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:59:27,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:59:27,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 22:59:27,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-15 22:59:27,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:59:27,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:59:27,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:59:27,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:59:27,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:59:27,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:59:27,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:59:27,744 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_int|], 2=[v_prenex_6]} [2019-11-15 22:59:27,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-15 22:59:27,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:27,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:27,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-15 22:59:27,775 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:27,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:27,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:59:27,796 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:53, output treesize:7 [2019-11-15 22:59:27,833 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:27,833 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:59:27,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2019-11-15 22:59:27,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394261443] [2019-11-15 22:59:27,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 22:59:27,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:27,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 22:59:27,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 22:59:27,835 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 33 states. [2019-11-15 22:59:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:29,328 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-11-15 22:59:29,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 22:59:29,328 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2019-11-15 22:59:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:29,329 INFO L225 Difference]: With dead ends: 70 [2019-11-15 22:59:29,329 INFO L226 Difference]: Without dead ends: 64 [2019-11-15 22:59:29,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=516, Invalid=3024, Unknown=0, NotChecked=0, Total=3540 [2019-11-15 22:59:29,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-15 22:59:29,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2019-11-15 22:59:29,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-15 22:59:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-11-15 22:59:29,333 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 40 [2019-11-15 22:59:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:29,333 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-11-15 22:59:29,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 22:59:29,333 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-11-15 22:59:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 22:59:29,334 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:29,335 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:29,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:29,538 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-15 22:59:29,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:29,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1305559289, now seen corresponding path program 1 times [2019-11-15 22:59:29,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:29,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416675319] [2019-11-15 22:59:29,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:29,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:29,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:29,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416675319] [2019-11-15 22:59:29,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432029246] [2019-11-15 22:59:29,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:30,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-15 22:59:30,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:30,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:59:30,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,174 INFO L567 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2019-11-15 22:59:30,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-11-15 22:59:30,215 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:30,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:59:30,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:30,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-15 22:59:30,269 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_18|], 2=[|v_#memory_int_24|]} [2019-11-15 22:59:30,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:59:30,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:30,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:59:30,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 22:59:30,298 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:30,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,311 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2019-11-15 22:59:30,353 INFO L375 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 20 treesize of output 8 [2019-11-15 22:59:30,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:30,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2019-11-15 22:59:30,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:59:30,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:30,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-15 22:59:30,494 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:30,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:59:30,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:30,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-11-15 22:59:30,530 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_19|], 6=[|v_#memory_int_26|]} [2019-11-15 22:59:30,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:59:30,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:30,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:59:30,549 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 22:59:30,550 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:30,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,559 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2019-11-15 22:59:30,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-15 22:59:30,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:30,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:59:30,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26 [2019-11-15 22:59:30,699 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:30,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2019-11-15 22:59:30,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,752 INFO L567 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2019-11-15 22:59:30,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:59:30,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 22:59:30,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:41 [2019-11-15 22:59:30,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:59:30,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:59:30,949 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:30,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-11-15 22:59:30,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:59:30,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:59:30,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:59:30,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:12 [2019-11-15 22:59:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:59:31,017 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:59:31,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-11-15 22:59:31,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032651570] [2019-11-15 22:59:31,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-15 22:59:31,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:31,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-15 22:59:31,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 22:59:31,018 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 36 states. [2019-11-15 22:59:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:31,979 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-11-15 22:59:31,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 22:59:31,980 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 41 [2019-11-15 22:59:31,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:31,980 INFO L225 Difference]: With dead ends: 49 [2019-11-15 22:59:31,980 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:59:31,981 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=441, Invalid=2639, Unknown=0, NotChecked=0, Total=3080 [2019-11-15 22:59:31,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:59:31,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:59:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:59:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:59:31,982 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-11-15 22:59:31,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:31,982 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:59:31,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-15 22:59:31,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:59:31,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:59:32,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:32,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:59:32 BoogieIcfgContainer [2019-11-15 22:59:32,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:59:32,188 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:59:32,188 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:59:32,188 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:59:32,189 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:59:16" (3/4) ... [2019-11-15 22:59:32,192 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:59:32,198 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-15 22:59:32,198 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-15 22:59:32,198 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-15 22:59:32,198 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-15 22:59:32,199 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-15 22:59:32,199 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-15 22:59:32,199 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-15 22:59:32,199 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-15 22:59:32,204 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-15 22:59:32,205 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 22:59:32,205 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 22:59:32,248 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a49dc9d9-2120-4591-b32f-3c78b9381d94/bin/uautomizer/witness.graphml [2019-11-15 22:59:32,248 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:59:32,249 INFO L168 Benchmark]: Toolchain (without parser) took 16701.53 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 283.6 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -133.5 MB). Peak memory consumption was 150.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:59:32,250 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:59:32,250 INFO L168 Benchmark]: CACSL2BoogieTranslator took 546.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:59:32,250 INFO L168 Benchmark]: Boogie Preprocessor took 61.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:59:32,251 INFO L168 Benchmark]: RCFGBuilder took 800.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:59:32,251 INFO L168 Benchmark]: TraceAbstraction took 15228.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.6 MB). Peak memory consumption was 112.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:59:32,251 INFO L168 Benchmark]: Witness Printer took 60.42 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:59:32,252 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 546.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 800.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15228.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.6 MB). Peak memory consumption was 112.7 MB. Max. memory is 11.5 GB. * Witness Printer took 60.42 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 96 locations, 29 error locations. Result: SAFE, OverallTime: 15.1s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 719 SDtfs, 1688 SDslu, 2598 SDs, 0 SdLazy, 4549 SolverSat, 501 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2591 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 341 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 499 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 480 ConstructedInterpolants, 33 QuantifiedInterpolants, 151318 SizeOfPredicates, 65 NumberOfNonLiveVariables, 658 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 23/80 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...