./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-sorted-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/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 3d1a973dcd7009ffcd2eda1338249f4d290fb62a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:53:11,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:53:11,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:53:11,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:53:11,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:53:11,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:53:11,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:53:11,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:53:11,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:53:11,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:53:11,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:53:11,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:53:11,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:53:11,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:53:11,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:53:11,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:53:11,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:53:11,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:53:11,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:53:11,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:53:11,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:53:11,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:53:11,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:53:11,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:53:11,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:53:11,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:53:11,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:53:11,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:53:11,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:53:11,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:53:11,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:53:11,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:53:11,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:53:11,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:53:11,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:53:11,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:53:11,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:53:11,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:53:11,253 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:53:11,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:53:11,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:53:11,254 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-12-07 18:53:11,264 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:53:11,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:53:11,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:53:11,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:53:11,265 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:53:11,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:53:11,265 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:53:11,266 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:53:11,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:53:11,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:53:11,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:53:11,266 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 18:53:11,266 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 18:53:11,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:53:11,266 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 18:53:11,267 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:53:11,267 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:53:11,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:53:11,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:53:11,267 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:53:11,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:53:11,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:53:11,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:53:11,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:53:11,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:53:11,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:53:11,268 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:53:11,268 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_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/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 -> 3d1a973dcd7009ffcd2eda1338249f4d290fb62a [2019-12-07 18:53:11,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:53:11,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:53:11,379 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:53:11,380 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:53:11,380 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:53:11,381 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-sorted-1.i [2019-12-07 18:53:11,417 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/bin/uautomizer/data/85f3fddab/4bb514188a9d4c2b8da291f80049079f/FLAGb09b88e8a [2019-12-07 18:53:11,883 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:53:11,884 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/sv-benchmarks/c/forester-heap/dll-sorted-1.i [2019-12-07 18:53:11,892 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/bin/uautomizer/data/85f3fddab/4bb514188a9d4c2b8da291f80049079f/FLAGb09b88e8a [2019-12-07 18:53:11,901 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/bin/uautomizer/data/85f3fddab/4bb514188a9d4c2b8da291f80049079f [2019-12-07 18:53:11,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:53:11,903 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 18:53:11,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:53:11,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:53:11,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:53:11,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:53:11" (1/1) ... [2019-12-07 18:53:11,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:11, skipping insertion in model container [2019-12-07 18:53:11,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:53:11" (1/1) ... [2019-12-07 18:53:11,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:53:11,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:53:12,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:53:12,148 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:53:12,180 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:53:12,209 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:53:12,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:12 WrapperNode [2019-12-07 18:53:12,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:53:12,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:53:12,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:53:12,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:53:12,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:12" (1/1) ... [2019-12-07 18:53:12,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:12" (1/1) ... [2019-12-07 18:53:12,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:12" (1/1) ... [2019-12-07 18:53:12,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:12" (1/1) ... [2019-12-07 18:53:12,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:12" (1/1) ... [2019-12-07 18:53:12,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:12" (1/1) ... [2019-12-07 18:53:12,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:12" (1/1) ... [2019-12-07 18:53:12,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:53:12,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:53:12,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:53:12,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:53:12,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:53:12,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 18:53:12,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:53:12,295 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 18:53:12,295 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 18:53:12,295 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 18:53:12,295 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 18:53:12,296 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 18:53:12,296 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 18:53:12,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 18:53:12,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 18:53:12,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 18:53:12,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 18:53:12,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 18:53:12,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 18:53:12,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 18:53:12,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 18:53:12,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 18:53:12,297 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 18:53:12,297 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 18:53:12,297 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 18:53:12,297 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 18:53:12,297 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 18:53:12,297 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 18:53:12,297 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 18:53:12,297 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 18:53:12,297 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 18:53:12,298 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 18:53:12,298 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 18:53:12,298 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 18:53:12,298 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 18:53:12,298 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 18:53:12,298 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 18:53:12,298 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 18:53:12,298 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 18:53:12,298 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 18:53:12,298 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 18:53:12,298 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 18:53:12,298 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 18:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 18:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 18:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 18:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 18:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 18:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 18:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 18:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 18:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 18:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 18:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 18:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 18:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 18:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 18:53:12,300 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 18:53:12,300 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 18:53:12,300 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 18:53:12,300 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 18:53:12,300 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 18:53:12,300 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 18:53:12,300 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 18:53:12,300 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 18:53:12,300 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 18:53:12,300 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 18:53:12,300 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 18:53:12,300 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 18:53:12,300 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 18:53:12,300 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 18:53:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 18:53:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 18:53:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 18:53:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 18:53:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 18:53:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 18:53:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 18:53:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 18:53:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 18:53:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 18:53:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 18:53:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 18:53:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 18:53:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 18:53:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 18:53:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 18:53:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 18:53:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 18:53:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 18:53:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 18:53:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 18:53:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 18:53:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 18:53:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 18:53:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 18:53:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 18:53:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 18:53:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 18:53:12,303 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 18:53:12,303 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 18:53:12,303 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 18:53:12,303 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 18:53:12,303 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 18:53:12,303 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 18:53:12,303 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 18:53:12,303 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 18:53:12,303 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 18:53:12,303 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 18:53:12,303 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 18:53:12,303 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 18:53:12,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 18:53:12,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 18:53:12,304 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 18:53:12,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:53:12,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:53:12,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:53:12,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:53:12,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:53:12,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:53:12,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 18:53:12,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:53:12,712 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:53:12,712 INFO L287 CfgBuilder]: Removed 18 assume(true) statements. [2019-12-07 18:53:12,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:53:12 BoogieIcfgContainer [2019-12-07 18:53:12,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:53:12,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:53:12,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:53:12,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:53:12,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:53:11" (1/3) ... [2019-12-07 18:53:12,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679baf49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:53:12, skipping insertion in model container [2019-12-07 18:53:12,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:12" (2/3) ... [2019-12-07 18:53:12,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679baf49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:53:12, skipping insertion in model container [2019-12-07 18:53:12,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:53:12" (3/3) ... [2019-12-07 18:53:12,718 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-sorted-1.i [2019-12-07 18:53:12,724 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:53:12,730 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 80 error locations. [2019-12-07 18:53:12,738 INFO L249 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2019-12-07 18:53:12,751 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:53:12,751 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 18:53:12,751 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:53:12,751 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:53:12,751 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:53:12,751 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:53:12,751 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:53:12,751 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:53:12,766 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states. [2019-12-07 18:53:12,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 18:53:12,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:12,773 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:12,773 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:12,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:12,777 INFO L82 PathProgramCache]: Analyzing trace with hash -121556121, now seen corresponding path program 1 times [2019-12-07 18:53:12,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:12,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874546101] [2019-12-07 18:53:12,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:12,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874546101] [2019-12-07 18:53:12,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:12,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:53:12,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283476943] [2019-12-07 18:53:12,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:53:12,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:12,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:53:12,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:53:12,918 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 4 states. [2019-12-07 18:53:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:13,196 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2019-12-07 18:53:13,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:53:13,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 18:53:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:13,204 INFO L225 Difference]: With dead ends: 185 [2019-12-07 18:53:13,204 INFO L226 Difference]: Without dead ends: 181 [2019-12-07 18:53:13,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:53:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-12-07 18:53:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2019-12-07 18:53:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-12-07 18:53:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 188 transitions. [2019-12-07 18:53:13,239 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 188 transitions. Word has length 7 [2019-12-07 18:53:13,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:13,239 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 188 transitions. [2019-12-07 18:53:13,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:53:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2019-12-07 18:53:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 18:53:13,240 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:13,240 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:13,240 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:13,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:13,240 INFO L82 PathProgramCache]: Analyzing trace with hash -121556120, now seen corresponding path program 1 times [2019-12-07 18:53:13,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:13,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503497071] [2019-12-07 18:53:13,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:13,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503497071] [2019-12-07 18:53:13,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:13,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:53:13,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999914620] [2019-12-07 18:53:13,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:53:13,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:13,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:53:13,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:53:13,283 INFO L87 Difference]: Start difference. First operand 177 states and 188 transitions. Second operand 4 states. [2019-12-07 18:53:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:13,495 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2019-12-07 18:53:13,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:53:13,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 18:53:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:13,497 INFO L225 Difference]: With dead ends: 178 [2019-12-07 18:53:13,497 INFO L226 Difference]: Without dead ends: 178 [2019-12-07 18:53:13,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:53:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-12-07 18:53:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2019-12-07 18:53:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 18:53:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2019-12-07 18:53:13,507 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 7 [2019-12-07 18:53:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:13,507 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2019-12-07 18:53:13,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:53:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2019-12-07 18:53:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:53:13,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:13,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:13,508 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:13,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:13,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1605620432, now seen corresponding path program 1 times [2019-12-07 18:53:13,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:13,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75747310] [2019-12-07 18:53:13,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:13,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:13,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75747310] [2019-12-07 18:53:13,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:13,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:53:13,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609964434] [2019-12-07 18:53:13,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:53:13,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:13,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:53:13,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:53:13,567 INFO L87 Difference]: Start difference. First operand 174 states and 185 transitions. Second operand 5 states. [2019-12-07 18:53:13,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:13,795 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2019-12-07 18:53:13,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:53:13,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 18:53:13,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:13,797 INFO L225 Difference]: With dead ends: 181 [2019-12-07 18:53:13,797 INFO L226 Difference]: Without dead ends: 181 [2019-12-07 18:53:13,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:53:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-12-07 18:53:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 170. [2019-12-07 18:53:13,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-07 18:53:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 192 transitions. [2019-12-07 18:53:13,807 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 192 transitions. Word has length 13 [2019-12-07 18:53:13,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:13,808 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 192 transitions. [2019-12-07 18:53:13,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:53:13,808 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 192 transitions. [2019-12-07 18:53:13,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:53:13,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:13,809 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:13,810 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:13,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:13,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1605620431, now seen corresponding path program 1 times [2019-12-07 18:53:13,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:13,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748995539] [2019-12-07 18:53:13,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:13,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748995539] [2019-12-07 18:53:13,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:13,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:53:13,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948007100] [2019-12-07 18:53:13,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:53:13,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:13,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:53:13,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:53:13,876 INFO L87 Difference]: Start difference. First operand 170 states and 192 transitions. Second operand 5 states. [2019-12-07 18:53:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:14,178 INFO L93 Difference]: Finished difference Result 260 states and 284 transitions. [2019-12-07 18:53:14,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:53:14,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 18:53:14,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:14,180 INFO L225 Difference]: With dead ends: 260 [2019-12-07 18:53:14,180 INFO L226 Difference]: Without dead ends: 260 [2019-12-07 18:53:14,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:53:14,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-07 18:53:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 222. [2019-12-07 18:53:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-07 18:53:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 266 transitions. [2019-12-07 18:53:14,188 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 266 transitions. Word has length 13 [2019-12-07 18:53:14,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:14,188 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 266 transitions. [2019-12-07 18:53:14,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:53:14,189 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 266 transitions. [2019-12-07 18:53:14,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:53:14,189 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:14,189 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:14,189 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:14,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:14,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1107996775, now seen corresponding path program 1 times [2019-12-07 18:53:14,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:14,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958589291] [2019-12-07 18:53:14,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:14,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958589291] [2019-12-07 18:53:14,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:14,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:53:14,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092920719] [2019-12-07 18:53:14,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:53:14,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:14,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:53:14,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:53:14,216 INFO L87 Difference]: Start difference. First operand 222 states and 266 transitions. Second operand 4 states. [2019-12-07 18:53:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:14,353 INFO L93 Difference]: Finished difference Result 267 states and 314 transitions. [2019-12-07 18:53:14,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:53:14,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 18:53:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:14,356 INFO L225 Difference]: With dead ends: 267 [2019-12-07 18:53:14,356 INFO L226 Difference]: Without dead ends: 267 [2019-12-07 18:53:14,356 INFO L630 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-12-07 18:53:14,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-12-07 18:53:14,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 234. [2019-12-07 18:53:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 18:53:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 285 transitions. [2019-12-07 18:53:14,366 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 285 transitions. Word has length 15 [2019-12-07 18:53:14,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:14,366 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 285 transitions. [2019-12-07 18:53:14,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:53:14,366 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 285 transitions. [2019-12-07 18:53:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:53:14,367 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:14,367 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:14,367 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:14,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:14,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1107976013, now seen corresponding path program 1 times [2019-12-07 18:53:14,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:14,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864229798] [2019-12-07 18:53:14,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:14,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864229798] [2019-12-07 18:53:14,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:14,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:53:14,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442302678] [2019-12-07 18:53:14,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:53:14,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:14,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:53:14,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:53:14,411 INFO L87 Difference]: Start difference. First operand 234 states and 285 transitions. Second operand 6 states. [2019-12-07 18:53:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:14,644 INFO L93 Difference]: Finished difference Result 237 states and 284 transitions. [2019-12-07 18:53:14,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:53:14,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-07 18:53:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:14,646 INFO L225 Difference]: With dead ends: 237 [2019-12-07 18:53:14,646 INFO L226 Difference]: Without dead ends: 237 [2019-12-07 18:53:14,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:53:14,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-12-07 18:53:14,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2019-12-07 18:53:14,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-12-07 18:53:14,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 282 transitions. [2019-12-07 18:53:14,651 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 282 transitions. Word has length 15 [2019-12-07 18:53:14,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:14,651 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 282 transitions. [2019-12-07 18:53:14,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:53:14,651 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 282 transitions. [2019-12-07 18:53:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:53:14,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:14,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:14,652 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:14,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:14,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1107976012, now seen corresponding path program 1 times [2019-12-07 18:53:14,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:14,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724074673] [2019-12-07 18:53:14,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:14,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724074673] [2019-12-07 18:53:14,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:14,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:53:14,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45641211] [2019-12-07 18:53:14,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:53:14,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:14,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:53:14,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:53:14,696 INFO L87 Difference]: Start difference. First operand 233 states and 282 transitions. Second operand 6 states. [2019-12-07 18:53:14,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:14,981 INFO L93 Difference]: Finished difference Result 232 states and 279 transitions. [2019-12-07 18:53:14,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:53:14,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-07 18:53:14,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:14,982 INFO L225 Difference]: With dead ends: 232 [2019-12-07 18:53:14,982 INFO L226 Difference]: Without dead ends: 232 [2019-12-07 18:53:14,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:53:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-12-07 18:53:14,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-12-07 18:53:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-07 18:53:14,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 279 transitions. [2019-12-07 18:53:14,987 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 279 transitions. Word has length 15 [2019-12-07 18:53:14,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:14,987 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 279 transitions. [2019-12-07 18:53:14,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:53:14,988 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 279 transitions. [2019-12-07 18:53:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:53:14,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:14,988 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:14,988 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:14,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:14,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1811872779, now seen corresponding path program 1 times [2019-12-07 18:53:14,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:14,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297697332] [2019-12-07 18:53:14,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:15,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297697332] [2019-12-07 18:53:15,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:15,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:53:15,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291022935] [2019-12-07 18:53:15,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:53:15,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:15,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:53:15,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:53:15,066 INFO L87 Difference]: Start difference. First operand 232 states and 279 transitions. Second operand 10 states. [2019-12-07 18:53:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:15,599 INFO L93 Difference]: Finished difference Result 238 states and 280 transitions. [2019-12-07 18:53:15,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:53:15,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-07 18:53:15,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:15,601 INFO L225 Difference]: With dead ends: 238 [2019-12-07 18:53:15,601 INFO L226 Difference]: Without dead ends: 238 [2019-12-07 18:53:15,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:53:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-12-07 18:53:15,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 231. [2019-12-07 18:53:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-12-07 18:53:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 277 transitions. [2019-12-07 18:53:15,606 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 277 transitions. Word has length 19 [2019-12-07 18:53:15,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:15,606 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 277 transitions. [2019-12-07 18:53:15,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:53:15,606 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 277 transitions. [2019-12-07 18:53:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:53:15,606 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:15,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:15,607 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:15,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:15,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1811872778, now seen corresponding path program 1 times [2019-12-07 18:53:15,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:15,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494000735] [2019-12-07 18:53:15,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:15,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494000735] [2019-12-07 18:53:15,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:15,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:53:15,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328611942] [2019-12-07 18:53:15,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:53:15,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:15,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:53:15,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:53:15,718 INFO L87 Difference]: Start difference. First operand 231 states and 277 transitions. Second operand 11 states. [2019-12-07 18:53:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:16,730 INFO L93 Difference]: Finished difference Result 233 states and 271 transitions. [2019-12-07 18:53:16,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:53:16,731 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-12-07 18:53:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:16,732 INFO L225 Difference]: With dead ends: 233 [2019-12-07 18:53:16,732 INFO L226 Difference]: Without dead ends: 233 [2019-12-07 18:53:16,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:53:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-07 18:53:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 218. [2019-12-07 18:53:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-12-07 18:53:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 260 transitions. [2019-12-07 18:53:16,737 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 260 transitions. Word has length 19 [2019-12-07 18:53:16,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:16,737 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 260 transitions. [2019-12-07 18:53:16,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:53:16,737 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 260 transitions. [2019-12-07 18:53:16,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:53:16,738 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:16,738 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:16,738 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:16,739 INFO L82 PathProgramCache]: Analyzing trace with hash 592662244, now seen corresponding path program 1 times [2019-12-07 18:53:16,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:16,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660033433] [2019-12-07 18:53:16,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:53:16,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660033433] [2019-12-07 18:53:16,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:16,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:53:16,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372599431] [2019-12-07 18:53:16,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:53:16,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:16,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:53:16,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:53:16,779 INFO L87 Difference]: Start difference. First operand 218 states and 260 transitions. Second operand 5 states. [2019-12-07 18:53:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:16,971 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2019-12-07 18:53:16,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:53:16,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 18:53:16,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:16,972 INFO L225 Difference]: With dead ends: 254 [2019-12-07 18:53:16,972 INFO L226 Difference]: Without dead ends: 254 [2019-12-07 18:53:16,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:53:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-12-07 18:53:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 216. [2019-12-07 18:53:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-07 18:53:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 256 transitions. [2019-12-07 18:53:16,977 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 256 transitions. Word has length 28 [2019-12-07 18:53:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:16,978 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 256 transitions. [2019-12-07 18:53:16,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:53:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 256 transitions. [2019-12-07 18:53:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:53:16,979 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:16,979 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:16,979 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:16,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:16,980 INFO L82 PathProgramCache]: Analyzing trace with hash -48484397, now seen corresponding path program 1 times [2019-12-07 18:53:16,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:16,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116527531] [2019-12-07 18:53:16,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:17,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116527531] [2019-12-07 18:53:17,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998719893] [2019-12-07 18:53:17,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:53:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:17,232 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 18:53:17,236 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:53:17,292 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:17,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 18:53:17,293 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:17,307 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 18:53:17,307 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:17,307 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-12-07 18:53:17,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:53:17,328 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:17,339 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:17,339 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:17,340 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-12-07 18:53:17,398 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:17,398 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2019-12-07 18:53:17,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:53:17,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:17,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:17,404 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 18:53:17,442 INFO L614 ElimStorePlain]: treesize reduction 137, result has 23.5 percent of original size [2019-12-07 18:53:17,443 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:17,443 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2019-12-07 18:53:17,564 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:17,564 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 110 [2019-12-07 18:53:17,565 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:17,588 INFO L614 ElimStorePlain]: treesize reduction 40, result has 52.4 percent of original size [2019-12-07 18:53:17,589 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:17,589 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:29 [2019-12-07 18:53:17,641 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-12-07 18:53:17,642 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 79 [2019-12-07 18:53:17,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:17,643 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:17,654 INFO L614 ElimStorePlain]: treesize reduction 32, result has 51.5 percent of original size [2019-12-07 18:53:17,655 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:17,655 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-12-07 18:53:17,718 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:17,718 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-12-07 18:53:17,719 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:17,727 INFO L614 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-12-07 18:53:17,727 INFO L534 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-12-07 18:53:17,727 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-12-07 18:53:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:17,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:53:17,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-12-07 18:53:17,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955135818] [2019-12-07 18:53:17,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 18:53:17,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:17,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 18:53:17,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-12-07 18:53:17,753 INFO L87 Difference]: Start difference. First operand 216 states and 256 transitions. Second operand 24 states. [2019-12-07 18:53:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:19,272 INFO L93 Difference]: Finished difference Result 418 states and 475 transitions. [2019-12-07 18:53:19,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 18:53:19,272 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2019-12-07 18:53:19,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:19,274 INFO L225 Difference]: With dead ends: 418 [2019-12-07 18:53:19,274 INFO L226 Difference]: Without dead ends: 418 [2019-12-07 18:53:19,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=316, Invalid=1490, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 18:53:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-12-07 18:53:19,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 240. [2019-12-07 18:53:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-12-07 18:53:19,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 285 transitions. [2019-12-07 18:53:19,281 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 285 transitions. Word has length 34 [2019-12-07 18:53:19,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:19,282 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 285 transitions. [2019-12-07 18:53:19,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 18:53:19,282 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 285 transitions. [2019-12-07 18:53:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:53:19,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:19,283 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:19,483 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:53:19,484 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:19,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:19,484 INFO L82 PathProgramCache]: Analyzing trace with hash -48484396, now seen corresponding path program 1 times [2019-12-07 18:53:19,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:19,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144195953] [2019-12-07 18:53:19,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:19,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144195953] [2019-12-07 18:53:19,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522625878] [2019-12-07 18:53:19,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:53:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:19,750 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 18:53:19,752 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:53:19,755 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_79|], 1=[|v_#valid_89|]} [2019-12-07 18:53:19,757 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 18:53:19,757 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:19,765 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:19,770 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:19,770 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 18:53:19,770 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:19,776 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:19,776 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:19,776 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-12-07 18:53:19,785 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:53:19,785 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:19,797 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:19,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:53:19,801 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:19,808 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:19,809 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:19,809 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-12-07 18:53:19,835 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-12-07 18:53:19,836 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:19,847 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:19,860 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:19,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 66 [2019-12-07 18:53:19,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:53:19,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:19,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:19,862 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 18:53:19,888 INFO L614 ElimStorePlain]: treesize reduction 52, result has 52.3 percent of original size [2019-12-07 18:53:19,888 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:19,888 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2019-12-07 18:53:19,991 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:19,992 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 60 [2019-12-07 18:53:19,992 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:20,023 INFO L614 ElimStorePlain]: treesize reduction 20, result has 80.4 percent of original size [2019-12-07 18:53:20,053 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:20,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 125 [2019-12-07 18:53:20,054 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:20,089 INFO L614 ElimStorePlain]: treesize reduction 40, result has 63.0 percent of original size [2019-12-07 18:53:20,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:20,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:20,090 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:20,090 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:38 [2019-12-07 18:53:20,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:53:20,119 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2019-12-07 18:53:20,120 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:20,129 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:20,158 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-12-07 18:53:20,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 86 [2019-12-07 18:53:20,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:20,160 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:20,177 INFO L614 ElimStorePlain]: treesize reduction 32, result has 59.5 percent of original size [2019-12-07 18:53:20,178 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:20,178 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2019-12-07 18:53:20,248 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:20,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2019-12-07 18:53:20,249 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:20,262 INFO L614 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-12-07 18:53:20,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 18:53:20,265 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:20,269 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:20,269 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:20,269 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-12-07 18:53:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:20,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:53:20,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2019-12-07 18:53:20,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354282139] [2019-12-07 18:53:20,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 18:53:20,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:20,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 18:53:20,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:53:20,276 INFO L87 Difference]: Start difference. First operand 240 states and 285 transitions. Second operand 21 states. [2019-12-07 18:53:22,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:22,691 INFO L93 Difference]: Finished difference Result 412 states and 464 transitions. [2019-12-07 18:53:22,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:53:22,691 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-12-07 18:53:22,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:22,692 INFO L225 Difference]: With dead ends: 412 [2019-12-07 18:53:22,693 INFO L226 Difference]: Without dead ends: 412 [2019-12-07 18:53:22,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=255, Invalid=1148, Unknown=3, NotChecked=0, Total=1406 [2019-12-07 18:53:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-12-07 18:53:22,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 240. [2019-12-07 18:53:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-12-07 18:53:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 284 transitions. [2019-12-07 18:53:22,698 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 284 transitions. Word has length 34 [2019-12-07 18:53:22,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:22,698 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 284 transitions. [2019-12-07 18:53:22,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 18:53:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 284 transitions. [2019-12-07 18:53:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:53:22,699 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:22,699 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:22,900 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:53:22,900 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:22,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:22,901 INFO L82 PathProgramCache]: Analyzing trace with hash 659877601, now seen corresponding path program 1 times [2019-12-07 18:53:22,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:22,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558408336] [2019-12-07 18:53:22,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:53:22,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558408336] [2019-12-07 18:53:22,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:22,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:53:22,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899069331] [2019-12-07 18:53:22,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:53:22,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:22,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:53:22,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:53:22,951 INFO L87 Difference]: Start difference. First operand 240 states and 284 transitions. Second operand 4 states. [2019-12-07 18:53:23,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:23,096 INFO L93 Difference]: Finished difference Result 242 states and 286 transitions. [2019-12-07 18:53:23,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:53:23,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 18:53:23,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:23,098 INFO L225 Difference]: With dead ends: 242 [2019-12-07 18:53:23,098 INFO L226 Difference]: Without dead ends: 242 [2019-12-07 18:53:23,098 INFO L630 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-12-07 18:53:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-07 18:53:23,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-12-07 18:53:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-07 18:53:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 286 transitions. [2019-12-07 18:53:23,102 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 286 transitions. Word has length 36 [2019-12-07 18:53:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:23,102 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 286 transitions. [2019-12-07 18:53:23,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:53:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 286 transitions. [2019-12-07 18:53:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:53:23,103 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:23,103 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:23,103 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:23,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:23,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1129950692, now seen corresponding path program 1 times [2019-12-07 18:53:23,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:23,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627717021] [2019-12-07 18:53:23,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:53:23,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627717021] [2019-12-07 18:53:23,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:23,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:53:23,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764517766] [2019-12-07 18:53:23,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:53:23,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:23,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:53:23,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:53:23,160 INFO L87 Difference]: Start difference. First operand 242 states and 286 transitions. Second operand 8 states. [2019-12-07 18:53:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:23,423 INFO L93 Difference]: Finished difference Result 259 states and 305 transitions. [2019-12-07 18:53:23,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:53:23,423 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-12-07 18:53:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:23,424 INFO L225 Difference]: With dead ends: 259 [2019-12-07 18:53:23,424 INFO L226 Difference]: Without dead ends: 259 [2019-12-07 18:53:23,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:53:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-12-07 18:53:23,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 250. [2019-12-07 18:53:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 18:53:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 295 transitions. [2019-12-07 18:53:23,428 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 295 transitions. Word has length 39 [2019-12-07 18:53:23,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:23,428 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 295 transitions. [2019-12-07 18:53:23,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:53:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 295 transitions. [2019-12-07 18:53:23,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:53:23,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:23,429 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:23,430 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:23,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:23,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1129891110, now seen corresponding path program 1 times [2019-12-07 18:53:23,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:23,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61567512] [2019-12-07 18:53:23,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:53:23,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61567512] [2019-12-07 18:53:23,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:23,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:53:23,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997487190] [2019-12-07 18:53:23,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:53:23,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:23,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:53:23,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:53:23,455 INFO L87 Difference]: Start difference. First operand 250 states and 295 transitions. Second operand 4 states. [2019-12-07 18:53:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:23,595 INFO L93 Difference]: Finished difference Result 247 states and 287 transitions. [2019-12-07 18:53:23,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:53:23,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-07 18:53:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:23,596 INFO L225 Difference]: With dead ends: 247 [2019-12-07 18:53:23,596 INFO L226 Difference]: Without dead ends: 247 [2019-12-07 18:53:23,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:53:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-12-07 18:53:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2019-12-07 18:53:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-07 18:53:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 287 transitions. [2019-12-07 18:53:23,600 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 287 transitions. Word has length 39 [2019-12-07 18:53:23,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:23,600 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 287 transitions. [2019-12-07 18:53:23,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:53:23,600 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 287 transitions. [2019-12-07 18:53:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:53:23,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:23,601 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:23,601 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:23,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:23,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1129891109, now seen corresponding path program 1 times [2019-12-07 18:53:23,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:23,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941132232] [2019-12-07 18:53:23,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:53:23,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941132232] [2019-12-07 18:53:23,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:23,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:53:23,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288947499] [2019-12-07 18:53:23,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:53:23,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:23,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:53:23,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:53:23,631 INFO L87 Difference]: Start difference. First operand 246 states and 287 transitions. Second operand 4 states. [2019-12-07 18:53:23,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:23,784 INFO L93 Difference]: Finished difference Result 242 states and 279 transitions. [2019-12-07 18:53:23,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:53:23,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-07 18:53:23,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:23,785 INFO L225 Difference]: With dead ends: 242 [2019-12-07 18:53:23,785 INFO L226 Difference]: Without dead ends: 242 [2019-12-07 18:53:23,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:53:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-07 18:53:23,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-12-07 18:53:23,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-07 18:53:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 279 transitions. [2019-12-07 18:53:23,789 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 279 transitions. Word has length 39 [2019-12-07 18:53:23,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:23,789 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 279 transitions. [2019-12-07 18:53:23,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:53:23,789 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 279 transitions. [2019-12-07 18:53:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:53:23,789 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:23,789 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:23,790 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:23,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:23,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1948795194, now seen corresponding path program 1 times [2019-12-07 18:53:23,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:23,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981479823] [2019-12-07 18:53:23,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:53:23,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981479823] [2019-12-07 18:53:23,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:23,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:53:23,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962956611] [2019-12-07 18:53:23,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:53:23,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:23,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:53:23,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:53:23,831 INFO L87 Difference]: Start difference. First operand 242 states and 279 transitions. Second operand 7 states. [2019-12-07 18:53:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:24,133 INFO L93 Difference]: Finished difference Result 262 states and 300 transitions. [2019-12-07 18:53:24,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:53:24,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-07 18:53:24,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:24,135 INFO L225 Difference]: With dead ends: 262 [2019-12-07 18:53:24,135 INFO L226 Difference]: Without dead ends: 262 [2019-12-07 18:53:24,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:53:24,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-12-07 18:53:24,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 241. [2019-12-07 18:53:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-12-07 18:53:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 278 transitions. [2019-12-07 18:53:24,141 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 278 transitions. Word has length 39 [2019-12-07 18:53:24,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:24,141 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 278 transitions. [2019-12-07 18:53:24,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:53:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 278 transitions. [2019-12-07 18:53:24,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:53:24,141 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:24,141 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:24,142 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:24,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:24,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1948795195, now seen corresponding path program 1 times [2019-12-07 18:53:24,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:24,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046801620] [2019-12-07 18:53:24,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:24,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:24,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046801620] [2019-12-07 18:53:24,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453874382] [2019-12-07 18:53:24,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/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-12-07 18:53:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:24,421 INFO L264 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 18:53:24,423 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:53:24,429 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:24,429 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 18:53:24,430 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:24,434 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:24,434 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:24,434 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-12-07 18:53:24,441 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:53:24,441 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:24,448 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:24,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:53:24,450 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:24,456 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:24,456 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:24,456 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2019-12-07 18:53:24,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-12-07 18:53:24,480 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:24,490 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:24,503 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:24,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 61 [2019-12-07 18:53:24,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:53:24,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:24,504 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 18:53:24,525 INFO L614 ElimStorePlain]: treesize reduction 43, result has 52.7 percent of original size [2019-12-07 18:53:24,525 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:24,525 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2019-12-07 18:53:24,559 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:24,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 37 [2019-12-07 18:53:24,560 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:24,564 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:24,564 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:24,564 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:21 [2019-12-07 18:53:24,614 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:24,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 52 [2019-12-07 18:53:24,614 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:24,630 INFO L614 ElimStorePlain]: treesize reduction 16, result has 68.0 percent of original size [2019-12-07 18:53:24,631 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:24,631 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-12-07 18:53:24,659 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-12-07 18:53:24,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-12-07 18:53:24,660 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:24,666 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:24,666 INFO L534 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-12-07 18:53:24,667 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-12-07 18:53:24,781 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-12-07 18:53:24,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-12-07 18:53:24,783 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:24,790 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:24,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2019-12-07 18:53:24,792 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:24,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:24,796 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:24,796 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:11 [2019-12-07 18:53:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:24,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:53:24,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2019-12-07 18:53:24,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071099303] [2019-12-07 18:53:24,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 18:53:24,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:24,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 18:53:24,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:53:24,840 INFO L87 Difference]: Start difference. First operand 241 states and 278 transitions. Second operand 28 states. [2019-12-07 18:53:27,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:27,193 INFO L93 Difference]: Finished difference Result 438 states and 494 transitions. [2019-12-07 18:53:27,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 18:53:27,194 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2019-12-07 18:53:27,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:27,195 INFO L225 Difference]: With dead ends: 438 [2019-12-07 18:53:27,196 INFO L226 Difference]: Without dead ends: 438 [2019-12-07 18:53:27,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=438, Invalid=2424, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 18:53:27,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-07 18:53:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 245. [2019-12-07 18:53:27,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-12-07 18:53:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 283 transitions. [2019-12-07 18:53:27,200 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 283 transitions. Word has length 39 [2019-12-07 18:53:27,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:27,200 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 283 transitions. [2019-12-07 18:53:27,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 18:53:27,200 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 283 transitions. [2019-12-07 18:53:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 18:53:27,201 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:27,201 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:27,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:53:27,402 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:27,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:27,402 INFO L82 PathProgramCache]: Analyzing trace with hash 199552039, now seen corresponding path program 1 times [2019-12-07 18:53:27,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:27,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443299981] [2019-12-07 18:53:27,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:53:27,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443299981] [2019-12-07 18:53:27,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:27,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:53:27,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376314064] [2019-12-07 18:53:27,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:53:27,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:27,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:53:27,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:53:27,453 INFO L87 Difference]: Start difference. First operand 245 states and 283 transitions. Second operand 7 states. [2019-12-07 18:53:27,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:27,751 INFO L93 Difference]: Finished difference Result 268 states and 307 transitions. [2019-12-07 18:53:27,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:53:27,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-07 18:53:27,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:27,752 INFO L225 Difference]: With dead ends: 268 [2019-12-07 18:53:27,752 INFO L226 Difference]: Without dead ends: 268 [2019-12-07 18:53:27,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:53:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-07 18:53:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 252. [2019-12-07 18:53:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-07 18:53:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 295 transitions. [2019-12-07 18:53:27,756 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 295 transitions. Word has length 43 [2019-12-07 18:53:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:27,756 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 295 transitions. [2019-12-07 18:53:27,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:53:27,756 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 295 transitions. [2019-12-07 18:53:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 18:53:27,757 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:27,757 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:27,757 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:27,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:27,757 INFO L82 PathProgramCache]: Analyzing trace with hash 199552040, now seen corresponding path program 1 times [2019-12-07 18:53:27,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:27,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814823222] [2019-12-07 18:53:27,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:27,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:27,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814823222] [2019-12-07 18:53:27,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533087060] [2019-12-07 18:53:27,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/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-12-07 18:53:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:28,015 INFO L264 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 18:53:28,017 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:53:28,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-12-07 18:53:28,059 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:28,063 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:28,064 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-12-07 18:53:28,065 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:28,070 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:28,070 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:28,071 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2019-12-07 18:53:28,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:53:28,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:53:28,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2019-12-07 18:53:28,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184980558] [2019-12-07 18:53:28,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:53:28,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:28,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:53:28,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:53:28,110 INFO L87 Difference]: Start difference. First operand 252 states and 295 transitions. Second operand 6 states. [2019-12-07 18:53:28,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:28,344 INFO L93 Difference]: Finished difference Result 264 states and 302 transitions. [2019-12-07 18:53:28,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:53:28,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-07 18:53:28,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:28,345 INFO L225 Difference]: With dead ends: 264 [2019-12-07 18:53:28,345 INFO L226 Difference]: Without dead ends: 264 [2019-12-07 18:53:28,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:53:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-12-07 18:53:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2019-12-07 18:53:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 18:53:28,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 290 transitions. [2019-12-07 18:53:28,349 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 290 transitions. Word has length 43 [2019-12-07 18:53:28,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:28,349 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 290 transitions. [2019-12-07 18:53:28,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:53:28,350 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 290 transitions. [2019-12-07 18:53:28,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 18:53:28,350 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:28,350 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:28,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:53:28,551 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:28,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:28,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1217603904, now seen corresponding path program 1 times [2019-12-07 18:53:28,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:28,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501357205] [2019-12-07 18:53:28,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:28,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501357205] [2019-12-07 18:53:28,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502715058] [2019-12-07 18:53:28,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:53:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:28,835 INFO L264 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 18:53:28,837 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:53:28,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:28,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 18:53:28,843 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:28,848 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:28,848 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:28,848 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-12-07 18:53:28,871 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:53:28,871 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:28,878 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:28,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:53:28,880 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:28,887 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:28,887 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:28,887 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2019-12-07 18:53:28,948 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:28,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 65 [2019-12-07 18:53:28,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:28,949 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:53:28,974 INFO L614 ElimStorePlain]: treesize reduction 48, result has 53.8 percent of original size [2019-12-07 18:53:28,976 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-12-07 18:53:28,976 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:28,984 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:28,985 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:28,985 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2019-12-07 18:53:29,108 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:29,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 114 [2019-12-07 18:53:29,109 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:29,144 INFO L614 ElimStorePlain]: treesize reduction 43, result has 61.3 percent of original size [2019-12-07 18:53:29,154 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:29,155 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 55 [2019-12-07 18:53:29,155 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:29,186 INFO L614 ElimStorePlain]: treesize reduction 16, result has 80.5 percent of original size [2019-12-07 18:53:29,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:29,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:29,188 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:29,188 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:36 [2019-12-07 18:53:29,233 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:29,234 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 98 [2019-12-07 18:53:29,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:29,235 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:29,253 INFO L614 ElimStorePlain]: treesize reduction 56, result has 53.7 percent of original size [2019-12-07 18:53:29,256 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2019-12-07 18:53:29,256 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:29,261 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:29,261 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:29,261 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:38 [2019-12-07 18:53:29,398 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:29,398 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 63 [2019-12-07 18:53:29,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:53:29,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:53:29,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:53:29,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:53:29,400 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:29,413 INFO L614 ElimStorePlain]: treesize reduction 28, result has 54.1 percent of original size [2019-12-07 18:53:29,417 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:29,417 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 18:53:29,417 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:29,421 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:29,421 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:29,421 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:7 [2019-12-07 18:53:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:29,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:53:29,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2019-12-07 18:53:29,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325220141] [2019-12-07 18:53:29,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 18:53:29,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:29,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 18:53:29,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-12-07 18:53:29,430 INFO L87 Difference]: Start difference. First operand 250 states and 290 transitions. Second operand 29 states. [2019-12-07 18:53:31,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:31,392 INFO L93 Difference]: Finished difference Result 414 states and 468 transitions. [2019-12-07 18:53:31,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 18:53:31,392 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 43 [2019-12-07 18:53:31,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:31,393 INFO L225 Difference]: With dead ends: 414 [2019-12-07 18:53:31,394 INFO L226 Difference]: Without dead ends: 414 [2019-12-07 18:53:31,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=365, Invalid=2497, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 18:53:31,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-12-07 18:53:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 253. [2019-12-07 18:53:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-12-07 18:53:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 293 transitions. [2019-12-07 18:53:31,398 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 293 transitions. Word has length 43 [2019-12-07 18:53:31,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:31,398 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 293 transitions. [2019-12-07 18:53:31,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 18:53:31,398 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 293 transitions. [2019-12-07 18:53:31,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:53:31,399 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:31,399 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:31,599 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:53:31,600 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:31,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:31,600 INFO L82 PathProgramCache]: Analyzing trace with hash -2028242710, now seen corresponding path program 1 times [2019-12-07 18:53:31,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:31,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958765907] [2019-12-07 18:53:31,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:31,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958765907] [2019-12-07 18:53:31,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355808741] [2019-12-07 18:53:31,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:53:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:31,816 INFO L264 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 18:53:31,817 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:53:31,824 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:31,824 INFO L377 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-12-07 18:53:31,824 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:31,828 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:31,828 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:31,829 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2019-12-07 18:53:31,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 18:53:31,834 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:31,839 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:31,840 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:31,840 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2019-12-07 18:53:31,869 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:31,869 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 56 [2019-12-07 18:53:31,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:31,870 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:31,876 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:31,876 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:31,876 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-12-07 18:53:32,035 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:32,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 109 [2019-12-07 18:53:32,036 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:32,090 INFO L614 ElimStorePlain]: treesize reduction 40, result has 48.7 percent of original size [2019-12-07 18:53:32,090 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:32,091 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:23 [2019-12-07 18:53:32,219 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-12-07 18:53:32,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2019-12-07 18:53:32,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:32,222 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:32,249 INFO L614 ElimStorePlain]: treesize reduction 32, result has 46.7 percent of original size [2019-12-07 18:53:32,249 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:53:32,250 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2019-12-07 18:53:32,377 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:53:32,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-12-07 18:53:32,379 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:53:32,393 INFO L614 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-12-07 18:53:32,393 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:53:32,393 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-12-07 18:53:32,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:53:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:32,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:53:32,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-12-07 18:53:32,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014009256] [2019-12-07 18:53:32,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 18:53:32,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:32,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 18:53:32,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:53:32,405 INFO L87 Difference]: Start difference. First operand 253 states and 293 transitions. Second operand 22 states. [2019-12-07 18:53:34,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:34,979 INFO L93 Difference]: Finished difference Result 404 states and 457 transitions. [2019-12-07 18:53:34,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 18:53:34,980 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-12-07 18:53:34,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:34,981 INFO L225 Difference]: With dead ends: 404 [2019-12-07 18:53:34,981 INFO L226 Difference]: Without dead ends: 404 [2019-12-07 18:53:34,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=300, Invalid=1506, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 18:53:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-12-07 18:53:34,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 253. [2019-12-07 18:53:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-12-07 18:53:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 292 transitions. [2019-12-07 18:53:34,986 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 292 transitions. Word has length 45 [2019-12-07 18:53:34,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:34,986 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 292 transitions. [2019-12-07 18:53:34,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 18:53:34,986 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 292 transitions. [2019-12-07 18:53:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:53:34,986 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:34,986 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:35,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:53:35,187 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_LEAK, mainErr30REQUIRES_VIOLATION, mainErr72REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr35ASSERT_VIOLATIONMEMORY_LEAK, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr74REQUIRES_VIOLATION, mainErr73REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr77ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr69REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr76ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr78ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr79ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr75REQUIRES_VIOLATION]=== [2019-12-07 18:53:35,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:35,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1504015161, now seen corresponding path program 1 times [2019-12-07 18:53:35,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:35,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183195667] [2019-12-07 18:53:35,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:35,230 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:53:35,230 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:53:35,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:53:35 BoogieIcfgContainer [2019-12-07 18:53:35,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:53:35,258 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:53:35,258 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:53:35,259 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:53:35,259 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:53:12" (3/4) ... [2019-12-07 18:53:35,260 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:53:35,294 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_91d9e8a2-d130-4c5b-9ed6-8faea0fce8c9/bin/uautomizer/witness.graphml [2019-12-07 18:53:35,295 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:53:35,295 INFO L168 Benchmark]: Toolchain (without parser) took 23392.24 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 455.1 MB). Free memory was 940.7 MB in the beginning and 1.4 GB in the end (delta: -441.2 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:53:35,296 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:53:35,296 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:53:35,296 INFO L168 Benchmark]: Boogie Preprocessor took 45.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:53:35,296 INFO L168 Benchmark]: RCFGBuilder took 457.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.4 MB). Peak memory consumption was 81.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:53:35,297 INFO L168 Benchmark]: TraceAbstraction took 22544.60 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.2 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -363.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:53:35,297 INFO L168 Benchmark]: Witness Printer took 36.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:53:35,298 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 457.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.4 MB). Peak memory consumption was 81.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22544.60 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.2 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -363.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 36.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1027]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L986] SLL* head = malloc(sizeof(SLL)); VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L987] head->next = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L988] head->prev = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L989] head->data = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L991] SLL* x = head; [L992] int marked = 0; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}] [L995] COND TRUE __VERIFIER_nondet_int() || !marked [L998] x->next = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}] [L999] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}] [L999] x->next->prev = x VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1000] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1000] x = x->next [L1001] x->next = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-2:0}] [L1003] COND TRUE __VERIFIER_nondet_int() [L1005] marked = 1 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=1, x={-2:0}] [L1008] COND TRUE \read(marked) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=1, x={-2:0}] [L1009] x->data = 1 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=1, x={-2:0}] [L995] COND FALSE !(__VERIFIER_nondet_int() || !marked) [L1014] x = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=1, x={-1:0}] [L1016] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=1, x={-1:0}] [L1017] marked = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}] [L1019] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1019] x->next != ((void*)0) && x->next->data == 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1] [L1019] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1] [L1019] EXPR x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1, x->next->data=1] [L1019] x->next != ((void*)0) && x->next->data == 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=0, x->next->data=1] [L1019] COND FALSE !(x->next != ((void*)0) && x->next->data == 0) [L1024] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1024] x->next != ((void*)0) && __VERIFIER_nondet_int() [L1024] x->next != ((void*)0) && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next != ((void*)0) && __VERIFIER_nondet_int()=1] [L1024] COND TRUE x->next != ((void*)0) && __VERIFIER_nondet_int() [L1026] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1026] x = x->next [L1027] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-2:0}, x->data=1] [L1027] COND TRUE !(x->data != 1) [L1027] __VERIFIER_error() VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 80 error locations. Result: UNSAFE, OverallTime: 22.4s, OverallIterations: 23, TraceHistogramMax: 2, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2383 SDtfs, 6645 SDslu, 8161 SDs, 0 SdLazy, 14897 SolverSat, 773 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 608 GetRequests, 253 SyntacticMatches, 13 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2727 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=21, 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, 22 MinimizatonAttempts, 1070 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 907 NumberOfCodeBlocks, 907 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 834 ConstructedInterpolants, 64 QuantifiedInterpolants, 322085 SizeOfPredicates, 86 NumberOfNonLiveVariables, 1160 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 28 InterpolantComputations, 17 PerfectInterpolantSequences, 22/52 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...