./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 22:41:18,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 22:41:18,349 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 22:41:18,356 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 22:41:18,357 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 22:41:18,357 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 22:41:18,358 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 22:41:18,359 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 22:41:18,360 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 22:41:18,361 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 22:41:18,361 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 22:41:18,362 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 22:41:18,362 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 22:41:18,363 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 22:41:18,363 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 22:41:18,364 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 22:41:18,364 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 22:41:18,365 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 22:41:18,366 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 22:41:18,367 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 22:41:18,368 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 22:41:18,368 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 22:41:18,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 22:41:18,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 22:41:18,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 22:41:18,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 22:41:18,371 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 22:41:18,372 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 22:41:18,372 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 22:41:18,373 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 22:41:18,373 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 22:41:18,374 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 22:41:18,374 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 22:41:18,374 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 22:41:18,375 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 22:41:18,375 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 22:41:18,375 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-01 22:41:18,385 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 22:41:18,386 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 22:41:18,386 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 22:41:18,387 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 22:41:18,387 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 22:41:18,387 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 22:41:18,387 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 22:41:18,388 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 22:41:18,388 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 22:41:18,388 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 22:41:18,388 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 22:41:18,388 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 22:41:18,388 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 22:41:18,388 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 22:41:18,389 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 22:41:18,389 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-01 22:41:18,389 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 22:41:18,389 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 22:41:18,389 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 22:41:18,389 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 22:41:18,390 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 22:41:18,390 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 22:41:18,390 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 22:41:18,390 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 22:41:18,390 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 22:41:18,390 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 22:41:18,391 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 22:41:18,391 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 22:41:18,391 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b [2018-12-01 22:41:18,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 22:41:18,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 22:41:18,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 22:41:18,423 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 22:41:18,423 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 22:41:18,424 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-01 22:41:18,459 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/data/6907c4f14/12699454906a4b0bbdddfef97115d4fa/FLAGeff816805 [2018-12-01 22:41:18,911 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 22:41:18,911 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-01 22:41:18,917 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/data/6907c4f14/12699454906a4b0bbdddfef97115d4fa/FLAGeff816805 [2018-12-01 22:41:18,926 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/data/6907c4f14/12699454906a4b0bbdddfef97115d4fa [2018-12-01 22:41:18,928 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 22:41:18,928 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-01 22:41:18,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 22:41:18,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 22:41:18,931 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 22:41:18,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:41:18" (1/1) ... [2018-12-01 22:41:18,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f76134a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:18, skipping insertion in model container [2018-12-01 22:41:18,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:41:18" (1/1) ... [2018-12-01 22:41:18,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 22:41:18,955 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 22:41:19,095 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:41:19,102 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 22:41:19,158 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:41:19,179 INFO L195 MainTranslator]: Completed translation [2018-12-01 22:41:19,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:19 WrapperNode [2018-12-01 22:41:19,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 22:41:19,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 22:41:19,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 22:41:19,179 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 22:41:19,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:19" (1/1) ... [2018-12-01 22:41:19,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:19" (1/1) ... [2018-12-01 22:41:19,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:19" (1/1) ... [2018-12-01 22:41:19,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:19" (1/1) ... [2018-12-01 22:41:19,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:19" (1/1) ... [2018-12-01 22:41:19,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:19" (1/1) ... [2018-12-01 22:41:19,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:19" (1/1) ... [2018-12-01 22:41:19,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 22:41:19,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 22:41:19,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 22:41:19,207 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 22:41:19,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/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 [2018-12-01 22:41:19,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 22:41:19,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 22:41:19,237 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-12-01 22:41:19,237 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2018-12-01 22:41:19,237 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 22:41:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-01 22:41:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-01 22:41:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-01 22:41:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-01 22:41:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-01 22:41:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-01 22:41:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-01 22:41:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-01 22:41:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-01 22:41:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-01 22:41:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-01 22:41:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-01 22:41:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-01 22:41:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-01 22:41:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-01 22:41:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-01 22:41:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-01 22:41:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-01 22:41:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-01 22:41:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-01 22:41:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-01 22:41:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-01 22:41:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-01 22:41:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-01 22:41:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-01 22:41:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-01 22:41:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-01 22:41:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-01 22:41:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-01 22:41:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-01 22:41:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-01 22:41:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-01 22:41:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-01 22:41:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-01 22:41:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-01 22:41:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-01 22:41:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-01 22:41:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-01 22:41:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-01 22:41:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-01 22:41:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-01 22:41:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-01 22:41:19,240 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-01 22:41:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-01 22:41:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-01 22:41:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-01 22:41:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-01 22:41:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-01 22:41:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-01 22:41:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-01 22:41:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-01 22:41:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-01 22:41:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-01 22:41:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-01 22:41:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-01 22:41:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-01 22:41:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-01 22:41:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-01 22:41:19,241 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-01 22:41:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-01 22:41:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-01 22:41:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-01 22:41:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-01 22:41:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-01 22:41:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-01 22:41:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-01 22:41:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-01 22:41:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-01 22:41:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-01 22:41:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-01 22:41:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-01 22:41:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-01 22:41:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-01 22:41:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-01 22:41:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-01 22:41:19,242 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-01 22:41:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-01 22:41:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-01 22:41:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-01 22:41:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-01 22:41:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-01 22:41:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-01 22:41:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-01 22:41:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-01 22:41:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-01 22:41:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-01 22:41:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-01 22:41:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-01 22:41:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-01 22:41:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-01 22:41:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-01 22:41:19,243 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-01 22:41:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-01 22:41:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-01 22:41:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-01 22:41:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-01 22:41:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-01 22:41:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-01 22:41:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-01 22:41:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-01 22:41:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-01 22:41:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-01 22:41:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2018-12-01 22:41:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 22:41:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 22:41:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 22:41:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 22:41:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2018-12-01 22:41:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 22:41:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 22:41:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 22:41:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 22:41:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 22:41:19,456 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 22:41:19,456 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-01 22:41:19,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:41:19 BoogieIcfgContainer [2018-12-01 22:41:19,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 22:41:19,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 22:41:19,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 22:41:19,458 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 22:41:19,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 10:41:18" (1/3) ... [2018-12-01 22:41:19,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6550d70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:41:19, skipping insertion in model container [2018-12-01 22:41:19,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:19" (2/3) ... [2018-12-01 22:41:19,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6550d70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:41:19, skipping insertion in model container [2018-12-01 22:41:19,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:41:19" (3/3) ... [2018-12-01 22:41:19,460 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2018-12-01 22:41:19,465 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 22:41:19,470 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-12-01 22:41:19,478 INFO L257 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2018-12-01 22:41:19,493 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 22:41:19,493 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 22:41:19,493 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-01 22:41:19,493 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 22:41:19,493 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 22:41:19,493 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 22:41:19,493 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 22:41:19,493 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 22:41:19,493 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 22:41:19,502 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-12-01 22:41:19,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 22:41:19,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:19,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:19,509 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION]=== [2018-12-01 22:41:19,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:19,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1994120175, now seen corresponding path program 1 times [2018-12-01 22:41:19,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:19,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:19,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:19,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:19,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:19,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:19,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:41:19,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:41:19,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:41:19,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:41:19,641 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 5 states. [2018-12-01 22:41:19,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:19,735 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-01 22:41:19,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:41:19,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-01 22:41:19,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:19,741 INFO L225 Difference]: With dead ends: 66 [2018-12-01 22:41:19,742 INFO L226 Difference]: Without dead ends: 63 [2018-12-01 22:41:19,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:41:19,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-01 22:41:19,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-01 22:41:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-01 22:41:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-01 22:41:19,764 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 9 [2018-12-01 22:41:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:19,764 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-01 22:41:19,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:41:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-01 22:41:19,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 22:41:19,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:19,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:19,765 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION]=== [2018-12-01 22:41:19,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:19,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1994120174, now seen corresponding path program 1 times [2018-12-01 22:41:19,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:19,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:19,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:19,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:19,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:19,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:19,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:41:19,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:41:19,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:41:19,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:41:19,814 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 5 states. [2018-12-01 22:41:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:19,903 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-01 22:41:19,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:41:19,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-01 22:41:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:19,905 INFO L225 Difference]: With dead ends: 62 [2018-12-01 22:41:19,905 INFO L226 Difference]: Without dead ends: 62 [2018-12-01 22:41:19,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:41:19,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-01 22:41:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-01 22:41:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-01 22:41:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-01 22:41:19,909 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 9 [2018-12-01 22:41:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:19,909 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-01 22:41:19,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:41:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-01 22:41:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 22:41:19,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:19,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:19,910 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION]=== [2018-12-01 22:41:19,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:19,910 INFO L82 PathProgramCache]: Analyzing trace with hash -794074733, now seen corresponding path program 1 times [2018-12-01 22:41:19,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:19,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:19,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:19,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:19,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:19,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:19,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 22:41:19,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 22:41:19,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 22:41:19,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:41:19,968 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 7 states. [2018-12-01 22:41:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:20,058 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-01 22:41:20,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:41:20,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-01 22:41:20,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:20,059 INFO L225 Difference]: With dead ends: 59 [2018-12-01 22:41:20,059 INFO L226 Difference]: Without dead ends: 59 [2018-12-01 22:41:20,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-01 22:41:20,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-01 22:41:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-01 22:41:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-01 22:41:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-01 22:41:20,062 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 11 [2018-12-01 22:41:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:20,063 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-01 22:41:20,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 22:41:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-01 22:41:20,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 22:41:20,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:20,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:20,063 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION]=== [2018-12-01 22:41:20,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:20,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1398358869, now seen corresponding path program 1 times [2018-12-01 22:41:20,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:20,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:20,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:20,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:20,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:20,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:20,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:20,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:41:20,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:41:20,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:41:20,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:41:20,116 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 5 states. [2018-12-01 22:41:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:20,179 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-01 22:41:20,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 22:41:20,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-01 22:41:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:20,180 INFO L225 Difference]: With dead ends: 58 [2018-12-01 22:41:20,180 INFO L226 Difference]: Without dead ends: 58 [2018-12-01 22:41:20,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-01 22:41:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-01 22:41:20,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-01 22:41:20,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-01 22:41:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-01 22:41:20,183 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 13 [2018-12-01 22:41:20,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:20,183 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-01 22:41:20,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:41:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-01 22:41:20,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 22:41:20,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:20,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:20,183 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION]=== [2018-12-01 22:41:20,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:20,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1398358870, now seen corresponding path program 1 times [2018-12-01 22:41:20,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:20,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:20,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:20,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:20,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:20,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:20,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:41:20,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 22:41:20,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 22:41:20,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:41:20,256 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 6 states. [2018-12-01 22:41:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:20,369 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-01 22:41:20,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 22:41:20,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-12-01 22:41:20,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:20,370 INFO L225 Difference]: With dead ends: 57 [2018-12-01 22:41:20,370 INFO L226 Difference]: Without dead ends: 57 [2018-12-01 22:41:20,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-01 22:41:20,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-01 22:41:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-01 22:41:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-01 22:41:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-01 22:41:20,373 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 13 [2018-12-01 22:41:20,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:20,373 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-01 22:41:20,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 22:41:20,373 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-01 22:41:20,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-01 22:41:20,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:20,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:20,373 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION]=== [2018-12-01 22:41:20,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:20,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1621254566, now seen corresponding path program 1 times [2018-12-01 22:41:20,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:20,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:20,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:20,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:20,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:20,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:20,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-01 22:41:20,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 22:41:20,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 22:41:20,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-01 22:41:20,458 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 11 states. [2018-12-01 22:41:20,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:20,645 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-01 22:41:20,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 22:41:20,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-01 22:41:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:20,645 INFO L225 Difference]: With dead ends: 56 [2018-12-01 22:41:20,645 INFO L226 Difference]: Without dead ends: 56 [2018-12-01 22:41:20,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-01 22:41:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-01 22:41:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-01 22:41:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-01 22:41:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-01 22:41:20,648 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 16 [2018-12-01 22:41:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:20,648 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-01 22:41:20,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 22:41:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-01 22:41:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-01 22:41:20,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:20,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:20,649 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION]=== [2018-12-01 22:41:20,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1621254567, now seen corresponding path program 1 times [2018-12-01 22:41:20,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:20,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:20,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:20,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:20,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-01 22:41:20,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 22:41:20,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 22:41:20,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-01 22:41:20,751 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 11 states. [2018-12-01 22:41:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:20,921 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-01 22:41:20,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 22:41:20,921 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-01 22:41:20,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:20,922 INFO L225 Difference]: With dead ends: 55 [2018-12-01 22:41:20,922 INFO L226 Difference]: Without dead ends: 55 [2018-12-01 22:41:20,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-01 22:41:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-01 22:41:20,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-01 22:41:20,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-01 22:41:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-01 22:41:20,924 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 16 [2018-12-01 22:41:20,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:20,924 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-01 22:41:20,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 22:41:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-01 22:41:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 22:41:20,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:20,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:20,925 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION]=== [2018-12-01 22:41:20,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:20,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1732146569, now seen corresponding path program 1 times [2018-12-01 22:41:20,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:20,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:20,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:20,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:20,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:20,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:20,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 22:41:20,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 22:41:20,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 22:41:20,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-01 22:41:20,973 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 8 states. [2018-12-01 22:41:21,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:21,040 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-01 22:41:21,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 22:41:21,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-01 22:41:21,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:21,041 INFO L225 Difference]: With dead ends: 59 [2018-12-01 22:41:21,041 INFO L226 Difference]: Without dead ends: 59 [2018-12-01 22:41:21,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-01 22:41:21,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-01 22:41:21,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-12-01 22:41:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-01 22:41:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-01 22:41:21,044 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 22 [2018-12-01 22:41:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:21,044 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-01 22:41:21,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 22:41:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-01 22:41:21,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 22:41:21,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:21,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:21,044 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION]=== [2018-12-01 22:41:21,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:21,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1732146570, now seen corresponding path program 1 times [2018-12-01 22:41:21,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:21,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:21,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:21,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:21,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:21,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:21,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 22:41:21,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 22:41:21,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 22:41:21,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-01 22:41:21,139 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 9 states. [2018-12-01 22:41:21,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:21,210 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-01 22:41:21,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 22:41:21,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-12-01 22:41:21,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:21,211 INFO L225 Difference]: With dead ends: 49 [2018-12-01 22:41:21,211 INFO L226 Difference]: Without dead ends: 49 [2018-12-01 22:41:21,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-01 22:41:21,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-01 22:41:21,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-01 22:41:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-01 22:41:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-01 22:41:21,213 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 22 [2018-12-01 22:41:21,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:21,214 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-01 22:41:21,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 22:41:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-01 22:41:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 22:41:21,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:21,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:21,214 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION]=== [2018-12-01 22:41:21,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:21,214 INFO L82 PathProgramCache]: Analyzing trace with hash 277407371, now seen corresponding path program 1 times [2018-12-01 22:41:21,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:21,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:21,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:21,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:21,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:21,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:21,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-01 22:41:21,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-01 22:41:21,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-01 22:41:21,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-12-01 22:41:21,521 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 18 states. [2018-12-01 22:41:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:22,143 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-01 22:41:22,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-01 22:41:22,143 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-12-01 22:41:22,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:22,145 INFO L225 Difference]: With dead ends: 50 [2018-12-01 22:41:22,145 INFO L226 Difference]: Without dead ends: 50 [2018-12-01 22:41:22,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2018-12-01 22:41:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-01 22:41:22,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-12-01 22:41:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-01 22:41:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-01 22:41:22,147 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 26 [2018-12-01 22:41:22,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:22,147 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-01 22:41:22,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-01 22:41:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-01 22:41:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 22:41:22,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:22,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:22,148 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION]=== [2018-12-01 22:41:22,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:22,148 INFO L82 PathProgramCache]: Analyzing trace with hash 277407372, now seen corresponding path program 1 times [2018-12-01 22:41:22,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:22,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:22,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:22,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:22,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:22,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:22,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-01 22:41:22,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-01 22:41:22,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-01 22:41:22,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-01 22:41:22,421 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 17 states. [2018-12-01 22:41:22,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:22,955 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-01 22:41:22,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-01 22:41:22,956 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-12-01 22:41:22,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:22,956 INFO L225 Difference]: With dead ends: 48 [2018-12-01 22:41:22,956 INFO L226 Difference]: Without dead ends: 48 [2018-12-01 22:41:22,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-12-01 22:41:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-01 22:41:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-12-01 22:41:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-01 22:41:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-01 22:41:22,959 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 26 [2018-12-01 22:41:22,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:22,959 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-01 22:41:22,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-01 22:41:22,959 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-01 22:41:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 22:41:22,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:22,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:22,960 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION]=== [2018-12-01 22:41:22,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:22,960 INFO L82 PathProgramCache]: Analyzing trace with hash 9693922, now seen corresponding path program 1 times [2018-12-01 22:41:22,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:22,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:22,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:22,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:22,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:23,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:23,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-01 22:41:23,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-01 22:41:23,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-01 22:41:23,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-12-01 22:41:23,333 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 17 states. [2018-12-01 22:41:24,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:24,247 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-01 22:41:24,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-01 22:41:24,248 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-12-01 22:41:24,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:24,248 INFO L225 Difference]: With dead ends: 47 [2018-12-01 22:41:24,248 INFO L226 Difference]: Without dead ends: 47 [2018-12-01 22:41:24,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2018-12-01 22:41:24,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-01 22:41:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-12-01 22:41:24,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-01 22:41:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-01 22:41:24,251 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 27 [2018-12-01 22:41:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:24,251 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-01 22:41:24,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-01 22:41:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-01 22:41:24,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 22:41:24,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:24,252 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:24,252 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION]=== [2018-12-01 22:41:24,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:24,252 INFO L82 PathProgramCache]: Analyzing trace with hash 9693923, now seen corresponding path program 1 times [2018-12-01 22:41:24,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:24,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:24,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:24,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:24,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:24,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:24,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-01 22:41:24,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-01 22:41:24,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-01 22:41:24,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-12-01 22:41:24,662 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 16 states. [2018-12-01 22:41:24,961 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-12-01 22:41:25,235 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2018-12-01 22:41:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:25,783 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-01 22:41:25,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-01 22:41:25,784 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2018-12-01 22:41:25,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:25,784 INFO L225 Difference]: With dead ends: 43 [2018-12-01 22:41:25,784 INFO L226 Difference]: Without dead ends: 43 [2018-12-01 22:41:25,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-12-01 22:41:25,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-01 22:41:25,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-01 22:41:25,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-01 22:41:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-01 22:41:25,786 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 27 [2018-12-01 22:41:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:25,786 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-01 22:41:25,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-01 22:41:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-01 22:41:25,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 22:41:25,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:25,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:25,787 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION]=== [2018-12-01 22:41:25,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:25,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1829250660, now seen corresponding path program 1 times [2018-12-01 22:41:25,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:25,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:25,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:25,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:25,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:26,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:26,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-01 22:41:26,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-01 22:41:26,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-01 22:41:26,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-01 22:41:26,227 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 20 states. [2018-12-01 22:41:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:27,029 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-01 22:41:27,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-01 22:41:27,029 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-12-01 22:41:27,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:27,030 INFO L225 Difference]: With dead ends: 45 [2018-12-01 22:41:27,030 INFO L226 Difference]: Without dead ends: 45 [2018-12-01 22:41:27,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2018-12-01 22:41:27,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-01 22:41:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-12-01 22:41:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-01 22:41:27,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-01 22:41:27,031 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 31 [2018-12-01 22:41:27,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:27,032 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-01 22:41:27,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-01 22:41:27,032 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-01 22:41:27,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 22:41:27,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:27,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:27,032 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION]=== [2018-12-01 22:41:27,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:27,033 INFO L82 PathProgramCache]: Analyzing trace with hash 872195698, now seen corresponding path program 1 times [2018-12-01 22:41:27,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:27,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:27,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:27,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:27,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:27,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:27,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:27,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-01 22:41:27,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-01 22:41:27,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-01 22:41:27,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-12-01 22:41:27,505 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 21 states. [2018-12-01 22:41:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:28,719 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-01 22:41:28,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-01 22:41:28,719 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2018-12-01 22:41:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:28,719 INFO L225 Difference]: With dead ends: 44 [2018-12-01 22:41:28,719 INFO L226 Difference]: Without dead ends: 44 [2018-12-01 22:41:28,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=219, Invalid=1503, Unknown=0, NotChecked=0, Total=1722 [2018-12-01 22:41:28,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-01 22:41:28,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-12-01 22:41:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-01 22:41:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-01 22:41:28,721 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 32 [2018-12-01 22:41:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:28,721 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-01 22:41:28,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-01 22:41:28,721 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-01 22:41:28,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 22:41:28,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:28,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:28,722 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION]=== [2018-12-01 22:41:28,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:28,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1268262954, now seen corresponding path program 1 times [2018-12-01 22:41:28,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:28,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:28,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:28,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:28,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:29,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:29,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-01 22:41:29,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-01 22:41:29,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-01 22:41:29,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-12-01 22:41:29,063 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-12-01 22:41:29,526 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-12-01 22:41:29,697 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-12-01 22:41:29,975 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2018-12-01 22:41:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:31,299 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-01 22:41:31,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-01 22:41:31,300 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-12-01 22:41:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:31,301 INFO L225 Difference]: With dead ends: 43 [2018-12-01 22:41:31,301 INFO L226 Difference]: Without dead ends: 43 [2018-12-01 22:41:31,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=190, Invalid=1216, Unknown=0, NotChecked=0, Total=1406 [2018-12-01 22:41:31,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-01 22:41:31,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-01 22:41:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-01 22:41:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-01 22:41:31,304 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 33 [2018-12-01 22:41:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:31,304 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-01 22:41:31,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-01 22:41:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-01 22:41:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 22:41:31,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:31,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:31,305 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr15REQUIRES_VIOLATION]=== [2018-12-01 22:41:31,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:31,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1243370469, now seen corresponding path program 1 times [2018-12-01 22:41:31,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:41:31,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:41:31,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:31,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:31,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:41:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:41:31,358 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 22:41:31,367 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-01 22:41:31,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 10:41:31 BoogieIcfgContainer [2018-12-01 22:41:31,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 22:41:31,376 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 22:41:31,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 22:41:31,376 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 22:41:31,377 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:41:19" (3/4) ... [2018-12-01 22:41:31,379 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 22:41:31,379 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 22:41:31,379 INFO L168 Benchmark]: Toolchain (without parser) took 12451.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.8 MB). Free memory was 951.8 MB in the beginning and 1.1 GB in the end (delta: -115.2 MB). Peak memory consumption was 107.6 MB. Max. memory is 11.5 GB. [2018-12-01 22:41:31,380 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:41:31,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 951.8 MB in the beginning and 1.1 GB in the end (delta: -140.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-01 22:41:31,380 INFO L168 Benchmark]: Boogie Preprocessor took 27.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 22:41:31,381 INFO L168 Benchmark]: RCFGBuilder took 248.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2018-12-01 22:41:31,381 INFO L168 Benchmark]: TraceAbstraction took 11919.38 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 120.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -24.5 MB). Peak memory consumption was 95.6 MB. Max. memory is 11.5 GB. [2018-12-01 22:41:31,381 INFO L168 Benchmark]: Witness Printer took 2.89 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:41:31,383 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 250.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 951.8 MB in the beginning and 1.1 GB in the end (delta: -140.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 248.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11919.38 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 120.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -24.5 MB). Peak memory consumption was 95.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.89 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] TData data; VAL [data={19:0}] [L643] CALL alloc_data(&data) VAL [pdata={19:0}] [L625] pdata->lo = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={10:0}, pdata={19:0}, pdata={19:0}] [L626] pdata->hi = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={10:0}, malloc(sizeof(int))={11:0}, pdata={19:0}, pdata={19:0}] [L627] EXPR pdata->lo VAL [malloc(sizeof(int))={10:0}, malloc(sizeof(int))={11:0}, pdata={19:0}, pdata={19:0}, pdata->lo={10:0}] [L627] *(pdata->lo) = 4 VAL [malloc(sizeof(int))={10:0}, malloc(sizeof(int))={11:0}, pdata={19:0}, pdata={19:0}, pdata->lo={10:0}] [L628] EXPR pdata->hi VAL [malloc(sizeof(int))={10:0}, malloc(sizeof(int))={11:0}, pdata={19:0}, pdata={19:0}, pdata->hi={11:0}] [L628] *(pdata->hi) = 8 VAL [malloc(sizeof(int))={10:0}, malloc(sizeof(int))={11:0}, pdata={19:0}, pdata={19:0}, pdata->hi={11:0}] [L643] RET alloc_data(&data) VAL [data={19:0}] [L644] CALL free_data(&data) VAL [data={19:0}] [L632] EXPR data->lo VAL [data={19:0}, data={19:0}, data->lo={10:0}] [L632] int *lo = data->lo; [L633] EXPR data->hi VAL [data={19:0}, data={19:0}, data->hi={11:0}, lo={10:0}] [L633] int *hi = data->hi; [L634] EXPR \read(*lo) VAL [\read(*lo)=4, data={19:0}, data={19:0}, hi={11:0}, lo={10:0}] [L634] EXPR \read(*hi) VAL [\read(*hi)=8, \read(*lo)=4, data={19:0}, data={19:0}, hi={11:0}, lo={10:0}] [L634] COND FALSE !(*lo >= *hi) [L638] data->lo = ((void *)0) VAL [data={19:0}, data={19:0}, hi={11:0}, lo={10:0}] [L639] data->hi = ((void *)0) VAL [data={19:0}, data={19:0}, hi={11:0}, lo={10:0}] [L644] RET free_data(&data) VAL [data={19:0}] [L645] return 0; [L645] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 70 locations, 29 error locations. UNSAFE Result, 11.8s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 8.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 518 SDtfs, 718 SDslu, 2299 SDs, 0 SdLazy, 3858 SolverSat, 300 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 25 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 124794 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-01 22:41:32,657 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 22:41:32,658 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 22:41:32,666 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 22:41:32,666 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 22:41:32,667 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 22:41:32,668 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 22:41:32,669 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 22:41:32,670 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 22:41:32,670 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 22:41:32,671 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 22:41:32,671 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 22:41:32,672 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 22:41:32,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 22:41:32,673 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 22:41:32,674 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 22:41:32,674 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 22:41:32,675 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 22:41:32,677 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 22:41:32,678 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 22:41:32,679 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 22:41:32,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 22:41:32,681 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 22:41:32,681 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 22:41:32,682 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 22:41:32,682 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 22:41:32,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 22:41:32,684 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 22:41:32,684 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 22:41:32,685 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 22:41:32,685 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 22:41:32,685 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 22:41:32,686 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 22:41:32,686 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 22:41:32,686 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 22:41:32,687 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 22:41:32,687 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-12-01 22:41:32,697 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 22:41:32,697 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 22:41:32,698 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 22:41:32,698 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 22:41:32,698 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 22:41:32,698 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 22:41:32,698 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 22:41:32,699 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 22:41:32,699 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 22:41:32,699 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 22:41:32,699 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 22:41:32,699 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 22:41:32,699 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 22:41:32,699 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 22:41:32,699 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 22:41:32,699 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-01 22:41:32,700 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 22:41:32,700 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-01 22:41:32,700 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-01 22:41:32,700 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 22:41:32,700 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 22:41:32,700 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 22:41:32,700 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 22:41:32,700 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 22:41:32,701 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 22:41:32,701 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 22:41:32,701 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 22:41:32,701 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 22:41:32,701 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-01 22:41:32,701 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 22:41:32,701 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-01 22:41:32,701 INFO L133 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b [2018-12-01 22:41:32,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 22:41:32,734 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 22:41:32,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 22:41:32,738 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 22:41:32,738 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 22:41:32,739 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-01 22:41:32,773 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/data/bc15b57e7/5a65c677dd12454ab5fd97b28d6b9d82/FLAG0015f1873 [2018-12-01 22:41:33,183 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 22:41:33,183 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-01 22:41:33,189 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/data/bc15b57e7/5a65c677dd12454ab5fd97b28d6b9d82/FLAG0015f1873 [2018-12-01 22:41:33,197 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/data/bc15b57e7/5a65c677dd12454ab5fd97b28d6b9d82 [2018-12-01 22:41:33,199 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 22:41:33,200 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-01 22:41:33,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 22:41:33,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 22:41:33,202 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 22:41:33,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:41:33" (1/1) ... [2018-12-01 22:41:33,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb0e1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:33, skipping insertion in model container [2018-12-01 22:41:33,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:41:33" (1/1) ... [2018-12-01 22:41:33,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 22:41:33,227 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 22:41:33,372 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:41:33,380 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 22:41:33,405 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:41:33,431 INFO L195 MainTranslator]: Completed translation [2018-12-01 22:41:33,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:33 WrapperNode [2018-12-01 22:41:33,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 22:41:33,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 22:41:33,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 22:41:33,432 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 22:41:33,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:33" (1/1) ... [2018-12-01 22:41:33,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:33" (1/1) ... [2018-12-01 22:41:33,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:33" (1/1) ... [2018-12-01 22:41:33,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:33" (1/1) ... [2018-12-01 22:41:33,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:33" (1/1) ... [2018-12-01 22:41:33,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:33" (1/1) ... [2018-12-01 22:41:33,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:33" (1/1) ... [2018-12-01 22:41:33,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 22:41:33,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 22:41:33,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 22:41:33,492 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 22:41:33,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/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 [2018-12-01 22:41:33,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 22:41:33,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 22:41:33,522 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-12-01 22:41:33,522 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2018-12-01 22:41:33,523 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 22:41:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-01 22:41:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-01 22:41:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-01 22:41:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-01 22:41:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-01 22:41:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-01 22:41:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-01 22:41:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-01 22:41:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-01 22:41:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-01 22:41:33,523 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-01 22:41:33,524 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-01 22:41:33,524 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-01 22:41:33,524 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-01 22:41:33,524 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-01 22:41:33,524 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-01 22:41:33,524 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-01 22:41:33,524 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-01 22:41:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-01 22:41:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-01 22:41:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-01 22:41:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-01 22:41:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-01 22:41:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-01 22:41:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-01 22:41:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-01 22:41:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-01 22:41:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-01 22:41:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-01 22:41:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-01 22:41:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-01 22:41:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-01 22:41:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-01 22:41:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-01 22:41:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-01 22:41:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-01 22:41:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-01 22:41:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-01 22:41:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-01 22:41:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-01 22:41:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-01 22:41:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-01 22:41:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-01 22:41:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-01 22:41:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-01 22:41:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-01 22:41:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-01 22:41:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-01 22:41:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-01 22:41:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-01 22:41:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-01 22:41:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-01 22:41:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-01 22:41:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-01 22:41:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-01 22:41:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-01 22:41:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-01 22:41:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-01 22:41:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-01 22:41:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-01 22:41:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-01 22:41:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-01 22:41:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-01 22:41:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-01 22:41:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-01 22:41:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-01 22:41:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-01 22:41:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-01 22:41:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-01 22:41:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-01 22:41:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-01 22:41:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-01 22:41:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-01 22:41:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-01 22:41:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-01 22:41:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-01 22:41:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-01 22:41:33,531 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-01 22:41:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-01 22:41:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-01 22:41:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-01 22:41:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-01 22:41:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-01 22:41:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-01 22:41:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-01 22:41:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-01 22:41:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-01 22:41:33,532 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-01 22:41:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-01 22:41:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-01 22:41:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-01 22:41:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-01 22:41:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-01 22:41:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-01 22:41:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-01 22:41:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-01 22:41:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-01 22:41:33,533 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-01 22:41:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-01 22:41:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-01 22:41:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-01 22:41:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-01 22:41:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2018-12-01 22:41:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 22:41:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 22:41:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 22:41:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-01 22:41:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2018-12-01 22:41:33,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-01 22:41:33,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 22:41:33,535 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 22:41:33,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 22:41:33,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 22:41:33,830 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 22:41:33,830 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-01 22:41:33,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:41:33 BoogieIcfgContainer [2018-12-01 22:41:33,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 22:41:33,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 22:41:33,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 22:41:33,833 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 22:41:33,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 10:41:33" (1/3) ... [2018-12-01 22:41:33,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d46e9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:41:33, skipping insertion in model container [2018-12-01 22:41:33,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:41:33" (2/3) ... [2018-12-01 22:41:33,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d46e9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:41:33, skipping insertion in model container [2018-12-01 22:41:33,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:41:33" (3/3) ... [2018-12-01 22:41:33,835 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2018-12-01 22:41:33,841 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 22:41:33,846 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-12-01 22:41:33,855 INFO L257 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2018-12-01 22:41:33,871 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 22:41:33,872 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 22:41:33,872 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-01 22:41:33,872 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 22:41:33,872 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 22:41:33,872 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 22:41:33,872 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 22:41:33,872 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 22:41:33,872 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 22:41:33,883 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-12-01 22:41:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 22:41:33,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:33,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:33,890 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-01 22:41:33,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:33,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1994120175, now seen corresponding path program 1 times [2018-12-01 22:41:33,896 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 22:41:33,896 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 22:41:33,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:33,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:33,977 INFO L478 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 [2018-12-01 22:41:33,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:33,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:33,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-01 22:41:34,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 22:41:34,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:34,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 22:41:34,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-01 22:41:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:34,018 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 22:41:34,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:34,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:41:34,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:41:34,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:41:34,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:41:34,032 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 5 states. [2018-12-01 22:41:34,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:34,228 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-01 22:41:34,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:41:34,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-01 22:41:34,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:34,235 INFO L225 Difference]: With dead ends: 66 [2018-12-01 22:41:34,235 INFO L226 Difference]: Without dead ends: 63 [2018-12-01 22:41:34,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:41:34,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-01 22:41:34,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-01 22:41:34,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-01 22:41:34,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-01 22:41:34,259 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 9 [2018-12-01 22:41:34,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:34,260 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-01 22:41:34,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:41:34,260 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-01 22:41:34,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 22:41:34,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:34,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:34,260 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-01 22:41:34,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:34,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1994120174, now seen corresponding path program 1 times [2018-12-01 22:41:34,261 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 22:41:34,261 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 22:41:34,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:34,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:34,321 INFO L478 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 [2018-12-01 22:41:34,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:34,330 INFO L478 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 [2018-12-01 22:41:34,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:34,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:34,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-01 22:41:34,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:34,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:34,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 21 [2018-12-01 22:41:34,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:34,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:34,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:34,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 22:41:34,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:34,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 22:41:34,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-12-01 22:41:34,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:34,411 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 22:41:34,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:34,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:41:34,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:41:34,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:41:34,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:41:34,414 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 5 states. [2018-12-01 22:41:34,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:34,680 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-01 22:41:34,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:41:34,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-01 22:41:34,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:34,681 INFO L225 Difference]: With dead ends: 62 [2018-12-01 22:41:34,681 INFO L226 Difference]: Without dead ends: 62 [2018-12-01 22:41:34,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:41:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-01 22:41:34,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-01 22:41:34,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-01 22:41:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-01 22:41:34,685 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 9 [2018-12-01 22:41:34,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:34,685 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-01 22:41:34,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:41:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-01 22:41:34,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 22:41:34,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:34,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:34,686 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-01 22:41:34,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:34,686 INFO L82 PathProgramCache]: Analyzing trace with hash -794074733, now seen corresponding path program 1 times [2018-12-01 22:41:34,686 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 22:41:34,686 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 22:41:34,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:34,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:34,740 INFO L478 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 [2018-12-01 22:41:34,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:34,747 INFO L478 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 [2018-12-01 22:41:34,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:34,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:34,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-01 22:41:34,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:34,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:34,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-01 22:41:34,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:34,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:34,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 21 [2018-12-01 22:41:34,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:34,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 22:41:34,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-12-01 22:41:34,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:34,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:34,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-01 22:41:34,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:34,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:34,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:34,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-12-01 22:41:34,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:34,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 22:41:34,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2018-12-01 22:41:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:34,892 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 22:41:34,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:34,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:41:34,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 22:41:34,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 22:41:34,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:41:34,894 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 6 states. [2018-12-01 22:41:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:35,115 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-01 22:41:35,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:41:35,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-12-01 22:41:35,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:35,116 INFO L225 Difference]: With dead ends: 59 [2018-12-01 22:41:35,116 INFO L226 Difference]: Without dead ends: 59 [2018-12-01 22:41:35,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:41:35,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-01 22:41:35,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-01 22:41:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-01 22:41:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-01 22:41:35,120 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 11 [2018-12-01 22:41:35,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:35,120 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-01 22:41:35,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 22:41:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-01 22:41:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 22:41:35,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:35,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:35,121 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-01 22:41:35,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:35,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1398358869, now seen corresponding path program 1 times [2018-12-01 22:41:35,122 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 22:41:35,122 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 22:41:35,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:35,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:35,179 INFO L478 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 [2018-12-01 22:41:35,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:35,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:35,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 22:41:35,195 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 22:41:35,197 INFO L478 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 8 treesize of output 7 [2018-12-01 22:41:35,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:35,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:35,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:35,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:20 [2018-12-01 22:41:35,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:35,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:35,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:35,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 46 [2018-12-01 22:41:35,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:35,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:35,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:38 [2018-12-01 22:41:35,273 INFO L478 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 32 treesize of output 25 [2018-12-01 22:41:35,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:35,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2018-12-01 22:41:35,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:35,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:35,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:35,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:56 [2018-12-01 22:41:35,340 INFO L478 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 47 treesize of output 35 [2018-12-01 22:41:35,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2018-12-01 22:41:35,345 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 22:41:35,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 22:41:35,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 22:41:35,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:27 [2018-12-01 22:41:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:35,396 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 22:41:35,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:35,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 22:41:35,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 22:41:35,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 22:41:35,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-01 22:41:35,398 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 9 states. [2018-12-01 22:41:35,700 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-12-01 22:41:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:35,930 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-01 22:41:35,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 22:41:35,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-12-01 22:41:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:35,931 INFO L225 Difference]: With dead ends: 58 [2018-12-01 22:41:35,931 INFO L226 Difference]: Without dead ends: 58 [2018-12-01 22:41:35,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-12-01 22:41:35,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-01 22:41:35,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-01 22:41:35,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-01 22:41:35,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-01 22:41:35,935 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 13 [2018-12-01 22:41:35,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:35,935 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-01 22:41:35,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 22:41:35,935 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-01 22:41:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 22:41:35,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:35,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:35,936 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-01 22:41:35,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:35,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1398358870, now seen corresponding path program 1 times [2018-12-01 22:41:35,937 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 22:41:35,937 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 22:41:35,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:36,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:36,014 INFO L478 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 [2018-12-01 22:41:36,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,023 INFO L478 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 [2018-12-01 22:41:36,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-01 22:41:36,049 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 22:41:36,052 INFO L478 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 8 treesize of output 7 [2018-12-01 22:41:36,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,071 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 22:41:36,073 INFO L478 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 8 treesize of output 7 [2018-12-01 22:41:36,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,076 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-12-01 22:41:36,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:36,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:36,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-01 22:41:36,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 23 [2018-12-01 22:41:36,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:33 [2018-12-01 22:41:36,166 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-01 22:41:36,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:36,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 23 [2018-12-01 22:41:36,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,216 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-12-01 22:41:36,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:36,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 24 treesize of output 33 [2018-12-01 22:41:36,221 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,247 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2018-12-01 22:41:36,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-01 22:41:36,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-01 22:41:36,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,294 INFO L478 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 38 treesize of output 28 [2018-12-01 22:41:36,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2018-12-01 22:41:36,297 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 22:41:36,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 22:41:36,310 INFO L267 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. [2018-12-01 22:41:36,310 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:18 [2018-12-01 22:41:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:36,332 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 22:41:36,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:36,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 22:41:36,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 22:41:36,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 22:41:36,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-01 22:41:36,334 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 9 states. [2018-12-01 22:41:36,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:36,856 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-01 22:41:36,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 22:41:36,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-12-01 22:41:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:36,857 INFO L225 Difference]: With dead ends: 57 [2018-12-01 22:41:36,857 INFO L226 Difference]: Without dead ends: 57 [2018-12-01 22:41:36,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-01 22:41:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-01 22:41:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-01 22:41:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-01 22:41:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-01 22:41:36,859 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 13 [2018-12-01 22:41:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:36,859 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-01 22:41:36,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 22:41:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-01 22:41:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-01 22:41:36,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:36,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:36,860 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-01 22:41:36,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:36,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1621254566, now seen corresponding path program 1 times [2018-12-01 22:41:36,860 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 22:41:36,860 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 22:41:36,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:36,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:36,932 INFO L478 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 [2018-12-01 22:41:36,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 22:41:36,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:36,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:36,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 22:41:36,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-01 22:41:36,969 INFO L478 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 11 treesize of output 8 [2018-12-01 22:41:36,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-01 22:41:36,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:36,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-01 22:41:36,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-01 22:41:36,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:22 [2018-12-01 22:41:37,023 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-12-01 22:41:37,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:37,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 17 treesize of output 24 [2018-12-01 22:41:37,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-01 22:41:37,102 INFO L478 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 0 case distinctions, treesize of input 47 treesize of output 43 [2018-12-01 22:41:37,105 INFO L478 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 20 treesize of output 1 [2018-12-01 22:41:37,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:30 [2018-12-01 22:41:37,120 INFO L478 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 25 treesize of output 19 [2018-12-01 22:41:37,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-01 22:41:37,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,129 INFO L267 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. [2018-12-01 22:41:37,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:13 [2018-12-01 22:41:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:37,146 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 22:41:37,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:37,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 22:41:37,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 22:41:37,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 22:41:37,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-01 22:41:37,148 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 10 states. [2018-12-01 22:41:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:37,547 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-01 22:41:37,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 22:41:37,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-01 22:41:37,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:37,548 INFO L225 Difference]: With dead ends: 56 [2018-12-01 22:41:37,548 INFO L226 Difference]: Without dead ends: 56 [2018-12-01 22:41:37,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-12-01 22:41:37,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-01 22:41:37,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-01 22:41:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-01 22:41:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-01 22:41:37,550 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 16 [2018-12-01 22:41:37,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:37,550 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-01 22:41:37,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 22:41:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-01 22:41:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-01 22:41:37,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:37,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:37,551 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-01 22:41:37,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:37,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1621254567, now seen corresponding path program 1 times [2018-12-01 22:41:37,551 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 22:41:37,551 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 22:41:37,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:37,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:37,634 INFO L478 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 [2018-12-01 22:41:37,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 22:41:37,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:37,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:37,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 22:41:37,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-01 22:41:37,674 INFO L478 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 11 treesize of output 8 [2018-12-01 22:41:37,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-01 22:41:37,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-01 22:41:37,694 INFO L478 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 [2018-12-01 22:41:37,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-01 22:41:37,724 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-12-01 22:41:37,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:37,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 17 treesize of output 24 [2018-12-01 22:41:37,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,751 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 22:41:37,752 INFO L478 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 10 treesize of output 9 [2018-12-01 22:41:37,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,766 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:32 [2018-12-01 22:41:37,837 INFO L478 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 0 case distinctions, treesize of input 74 treesize of output 70 [2018-12-01 22:41:37,840 INFO L478 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 20 treesize of output 1 [2018-12-01 22:41:37,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,877 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-12-01 22:41:37,880 INFO L478 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 20 treesize of output 1 [2018-12-01 22:41:37,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,893 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:32 [2018-12-01 22:41:37,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-01 22:41:37,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-01 22:41:37,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,918 INFO L478 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 25 treesize of output 19 [2018-12-01 22:41:37,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-01 22:41:37,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:37,928 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:9 [2018-12-01 22:41:37,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:37,941 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 22:41:37,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:37,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 22:41:37,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 22:41:37,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 22:41:37,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-01 22:41:37,943 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 10 states. [2018-12-01 22:41:38,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:38,430 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-01 22:41:38,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 22:41:38,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-01 22:41:38,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:38,431 INFO L225 Difference]: With dead ends: 55 [2018-12-01 22:41:38,431 INFO L226 Difference]: Without dead ends: 55 [2018-12-01 22:41:38,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-12-01 22:41:38,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-01 22:41:38,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-01 22:41:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-01 22:41:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-01 22:41:38,433 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 16 [2018-12-01 22:41:38,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:38,433 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-01 22:41:38,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 22:41:38,433 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-01 22:41:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 22:41:38,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:38,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:38,433 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-01 22:41:38,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:38,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1732146569, now seen corresponding path program 1 times [2018-12-01 22:41:38,434 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 22:41:38,434 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 22:41:38,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:38,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:38,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 22:41:38,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:38,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:38,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-12-01 22:41:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:38,515 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 22:41:38,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:38,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 22:41:38,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 22:41:38,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 22:41:38,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:41:38,517 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 7 states. [2018-12-01 22:41:38,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:38,763 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-01 22:41:38,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 22:41:38,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-01 22:41:38,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:38,764 INFO L225 Difference]: With dead ends: 59 [2018-12-01 22:41:38,764 INFO L226 Difference]: Without dead ends: 59 [2018-12-01 22:41:38,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-01 22:41:38,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-01 22:41:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-12-01 22:41:38,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-01 22:41:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-01 22:41:38,768 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 22 [2018-12-01 22:41:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:38,768 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-01 22:41:38,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 22:41:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-01 22:41:38,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 22:41:38,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:38,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:38,769 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-01 22:41:38,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:38,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1732146570, now seen corresponding path program 1 times [2018-12-01 22:41:38,770 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 22:41:38,770 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 22:41:38,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:38,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:38,898 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 22:41:38,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:38,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 22:41:38,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 22:41:38,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 22:41:38,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-01 22:41:38,900 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 8 states. [2018-12-01 22:41:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:39,293 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-01 22:41:39,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 22:41:39,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-01 22:41:39,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:39,294 INFO L225 Difference]: With dead ends: 49 [2018-12-01 22:41:39,294 INFO L226 Difference]: Without dead ends: 49 [2018-12-01 22:41:39,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-01 22:41:39,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-01 22:41:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-01 22:41:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-01 22:41:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-01 22:41:39,296 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 22 [2018-12-01 22:41:39,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:39,297 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-01 22:41:39,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 22:41:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-01 22:41:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 22:41:39,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:39,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:39,297 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-01 22:41:39,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:39,298 INFO L82 PathProgramCache]: Analyzing trace with hash 277407371, now seen corresponding path program 1 times [2018-12-01 22:41:39,298 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 22:41:39,298 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 22:41:39,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:39,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:39,409 INFO L478 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 [2018-12-01 22:41:39,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:39,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:39,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 22:41:39,434 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 22:41:39,437 INFO L478 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 8 treesize of output 7 [2018-12-01 22:41:39,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:39,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:39,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:39,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-01 22:41:39,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:39,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:39,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-01 22:41:39,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:39,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:39,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-12-01 22:41:39,513 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-12-01 22:41:39,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:39,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 25 [2018-12-01 22:41:39,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:39,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:39,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:39,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-12-01 22:41:39,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 62 [2018-12-01 22:41:39,698 INFO L478 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 62 treesize of output 42 [2018-12-01 22:41:39,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:39,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 44 treesize of output 57 [2018-12-01 22:41:39,801 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-01 22:41:39,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 22:41:39,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 22:41:39,889 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:89 [2018-12-01 22:41:40,020 INFO L478 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 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-01 22:41:40,023 INFO L478 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 24 treesize of output 1 [2018-12-01 22:41:40,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:40,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:40,121 INFO L478 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 0 case distinctions, treesize of input 62 treesize of output 56 [2018-12-01 22:41:40,124 INFO L478 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 24 treesize of output 1 [2018-12-01 22:41:40,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:40,132 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:40,216 INFO L478 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 51 treesize of output 56 [2018-12-01 22:41:40,219 INFO L478 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 52 treesize of output 28 [2018-12-01 22:41:40,219 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:40,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:40,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 43 [2018-12-01 22:41:40,293 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-01 22:41:40,328 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 22:41:40,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-01 22:41:40,378 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:168, output treesize:80 [2018-12-01 22:41:40,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:40,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:40,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-12-01 22:41:40,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:40,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:40,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2018-12-01 22:41:40,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-12-01 22:41:40,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-12-01 22:41:40,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:40,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:40,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:40,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:5 [2018-12-01 22:41:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:40,660 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 22:41:40,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:40,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-01 22:41:40,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-01 22:41:40,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-01 22:41:40,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-12-01 22:41:40,663 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 17 states. [2018-12-01 22:41:43,414 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2018-12-01 22:41:44,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:41:44,158 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-01 22:41:44,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-01 22:41:44,159 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-12-01 22:41:44,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:41:44,160 INFO L225 Difference]: With dead ends: 50 [2018-12-01 22:41:44,160 INFO L226 Difference]: Without dead ends: 50 [2018-12-01 22:41:44,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-12-01 22:41:44,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-01 22:41:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-12-01 22:41:44,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-01 22:41:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-01 22:41:44,162 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 26 [2018-12-01 22:41:44,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:41:44,162 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-01 22:41:44,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-01 22:41:44,163 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-01 22:41:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 22:41:44,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:41:44,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:41:44,163 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-01 22:41:44,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:41:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash 277407372, now seen corresponding path program 1 times [2018-12-01 22:41:44,163 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 22:41:44,164 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 22:41:44,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:41:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:41:44,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:41:44,298 INFO L478 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 [2018-12-01 22:41:44,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:44,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:44,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 22:41:44,310 INFO L478 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 [2018-12-01 22:41:44,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:44,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:44,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-12-01 22:41:44,337 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 22:41:44,339 INFO L478 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 8 treesize of output 7 [2018-12-01 22:41:44,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:44,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:44,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:44,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:40 [2018-12-01 22:41:44,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:44,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 23 [2018-12-01 22:41:44,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:44,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:44,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:54 [2018-12-01 22:41:44,433 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 22:41:44,436 INFO L478 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 10 treesize of output 9 [2018-12-01 22:41:44,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:44,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:44,482 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2018-12-01 22:41:44,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:44,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:44,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 45 treesize of output 66 [2018-12-01 22:41:44,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:44,508 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:44,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:44,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:80, output treesize:66 [2018-12-01 22:41:44,697 INFO L478 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 108 [2018-12-01 22:41:44,708 INFO L478 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 107 treesize of output 79 [2018-12-01 22:41:44,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:44,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 91 [2018-12-01 22:41:44,898 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 22:41:45,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 22:41:45,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 94 [2018-12-01 22:41:45,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:45,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:45,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 72 [2018-12-01 22:41:45,174 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:45,198 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:45,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 130 [2018-12-01 22:41:45,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:45,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:45,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 111 treesize of output 110 [2018-12-01 22:41:45,304 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-01 22:41:45,583 INFO L478 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 123 treesize of output 95 [2018-12-01 22:41:45,584 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:45,716 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-01 22:41:45,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-01 22:41:45,835 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:173, output treesize:236 [2018-12-01 22:41:46,054 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-01 22:41:46,307 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-12-01 22:41:46,377 INFO L478 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 147 [2018-12-01 22:41:46,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 111 [2018-12-01 22:41:46,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 22:41:46,698 INFO L478 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 128 treesize of output 104 [2018-12-01 22:41:46,698 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:46,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 22:41:48,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:48,802 INFO L478 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 0 case distinctions, treesize of input 163 treesize of output 167 [2018-12-01 22:41:48,808 INFO L478 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 24 treesize of output 1 [2018-12-01 22:41:48,808 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:48,850 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:49,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:49,958 INFO L478 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 0 case distinctions, treesize of input 117 treesize of output 121 [2018-12-01 22:41:49,963 INFO L478 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 24 treesize of output 1 [2018-12-01 22:41:49,963 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:49,997 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:50,607 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 75 [2018-12-01 22:41:50,610 INFO L478 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 24 treesize of output 1 [2018-12-01 22:41:50,610 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:50,629 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:51,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:51,015 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 131 [2018-12-01 22:41:51,018 INFO L478 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 24 treesize of output 1 [2018-12-01 22:41:51,018 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:51,047 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:51,335 INFO L478 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 104 treesize of output 109 [2018-12-01 22:41:51,340 INFO L478 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 105 treesize of output 81 [2018-12-01 22:41:51,341 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:51,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:51,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 96 [2018-12-01 22:41:51,524 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-12-01 22:41:51,635 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 22:41:51,643 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 74 [2018-12-01 22:41:51,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:51,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-12-01 22:41:51,653 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:51,682 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:51,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-01 22:41:51,840 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 10 variables, input treesize:418, output treesize:272 [2018-12-01 22:41:54,121 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-12-01 22:41:54,253 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 38 [2018-12-01 22:41:54,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:54,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:54,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:41:54,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-12-01 22:41:54,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:54,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:54,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:312, output treesize:95 [2018-12-01 22:41:54,685 INFO L478 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 43 treesize of output 33 [2018-12-01 22:41:54,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-12-01 22:41:54,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:41:54,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:41:54,732 INFO L478 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 65 treesize of output 49 [2018-12-01 22:41:54,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2018-12-01 22:41:54,738 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 22:41:54,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 22:41:54,779 INFO L267 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. [2018-12-01 22:41:54,779 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:30 [2018-12-01 22:41:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:41:55,024 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 22:41:55,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:41:55,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-01 22:41:55,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-01 22:41:55,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-01 22:41:55,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=238, Unknown=1, NotChecked=0, Total=272 [2018-12-01 22:41:55,027 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 17 states. [2018-12-01 22:42:00,697 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 109 DAG size of output: 61 [2018-12-01 22:42:25,054 WARN L180 SmtUtils]: Spent 24.19 s on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2018-12-01 22:42:26,573 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-01 22:42:27,064 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-12-01 22:42:27,546 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-12-01 22:42:28,528 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2018-12-01 22:42:28,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:42:28,809 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-01 22:42:28,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-01 22:42:28,810 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-12-01 22:42:28,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:42:28,810 INFO L225 Difference]: With dead ends: 48 [2018-12-01 22:42:28,810 INFO L226 Difference]: Without dead ends: 48 [2018-12-01 22:42:28,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=94, Invalid=661, Unknown=1, NotChecked=0, Total=756 [2018-12-01 22:42:28,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-01 22:42:28,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-12-01 22:42:28,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-01 22:42:28,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-01 22:42:28,812 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 26 [2018-12-01 22:42:28,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:42:28,812 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-01 22:42:28,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-01 22:42:28,812 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-01 22:42:28,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 22:42:28,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:42:28,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:42:28,813 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-01 22:42:28,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:42:28,813 INFO L82 PathProgramCache]: Analyzing trace with hash 9693922, now seen corresponding path program 1 times [2018-12-01 22:42:28,813 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 22:42:28,813 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 22:42:28,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:42:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:42:28,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:42:28,938 INFO L478 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 [2018-12-01 22:42:28,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:28,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:28,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 22:42:28,963 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 22:42:28,965 INFO L478 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 8 treesize of output 7 [2018-12-01 22:42:28,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:28,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:28,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:28,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-01 22:42:28,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:28,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:28,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-01 22:42:28,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:29,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:29,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-12-01 22:42:29,026 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-12-01 22:42:29,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:29,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 25 [2018-12-01 22:42:29,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:29,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:29,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:29,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-12-01 22:42:29,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 55 [2018-12-01 22:42:29,166 INFO L478 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 51 treesize of output 31 [2018-12-01 22:42:29,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:29,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:29,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:29,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 56 [2018-12-01 22:42:29,252 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-01 22:42:29,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 22:42:29,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 22:42:29,318 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:68 [2018-12-01 22:42:29,451 INFO L478 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 0 case distinctions, treesize of input 66 treesize of output 60 [2018-12-01 22:42:29,454 INFO L478 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 24 treesize of output 1 [2018-12-01 22:42:29,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:29,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:29,561 INFO L478 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 0 case distinctions, treesize of input 62 treesize of output 56 [2018-12-01 22:42:29,564 INFO L478 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 24 treesize of output 1 [2018-12-01 22:42:29,564 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:29,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:29,668 INFO L478 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 62 [2018-12-01 22:42:29,671 INFO L478 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 58 treesize of output 34 [2018-12-01 22:42:29,672 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:29,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:29,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 45 [2018-12-01 22:42:29,745 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-01 22:42:29,894 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 22:42:29,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-01 22:42:29,943 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:188, output treesize:129 [2018-12-01 22:42:30,050 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-01 22:42:30,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:30,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:30,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:30,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-01 22:42:30,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:30,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:30,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:33 [2018-12-01 22:42:30,223 INFO L478 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 35 treesize of output 27 [2018-12-01 22:42:30,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-12-01 22:42:30,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:30,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:30,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:30,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:7 [2018-12-01 22:42:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:42:30,293 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 22:42:30,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:42:30,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-01 22:42:30,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-01 22:42:30,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-01 22:42:30,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-12-01 22:42:30,296 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 17 states. [2018-12-01 22:42:31,251 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2018-12-01 22:42:31,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:42:31,988 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-01 22:42:31,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-01 22:42:31,989 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-12-01 22:42:31,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:42:31,989 INFO L225 Difference]: With dead ends: 47 [2018-12-01 22:42:31,989 INFO L226 Difference]: Without dead ends: 47 [2018-12-01 22:42:31,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-12-01 22:42:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-01 22:42:31,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-12-01 22:42:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-01 22:42:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-01 22:42:31,992 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 27 [2018-12-01 22:42:31,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:42:31,992 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-01 22:42:31,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-01 22:42:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-01 22:42:31,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 22:42:31,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:42:31,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:42:31,993 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-01 22:42:31,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:42:31,993 INFO L82 PathProgramCache]: Analyzing trace with hash 9693923, now seen corresponding path program 1 times [2018-12-01 22:42:31,994 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 22:42:31,994 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 22:42:32,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:42:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:42:32,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:42:32,139 INFO L478 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 [2018-12-01 22:42:32,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:32,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:32,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 22:42:32,162 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 22:42:32,164 INFO L478 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 8 treesize of output 7 [2018-12-01 22:42:32,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:32,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:32,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:32,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-01 22:42:32,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:32,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:32,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-01 22:42:32,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:32,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-12-01 22:42:32,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:32,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:32,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:28 [2018-12-01 22:42:32,253 INFO L478 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 13 treesize of output 10 [2018-12-01 22:42:32,256 INFO L478 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 10 treesize of output 9 [2018-12-01 22:42:32,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:32,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:32,290 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-12-01 22:42:32,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:32,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 25 [2018-12-01 22:42:32,296 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:32,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:32,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:32,323 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:46 [2018-12-01 22:42:32,445 INFO L478 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2018-12-01 22:42:32,449 INFO L478 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 38 treesize of output 18 [2018-12-01 22:42:32,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:32,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 27 [2018-12-01 22:42:32,511 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 22:42:32,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 22:42:32,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 52 [2018-12-01 22:42:32,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 50 [2018-12-01 22:42:32,594 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 22:42:32,612 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 22:42:32,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 73 [2018-12-01 22:42:32,666 INFO L478 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 71 treesize of output 51 [2018-12-01 22:42:32,667 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:32,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 56 [2018-12-01 22:42:32,793 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-01 22:42:32,868 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-01 22:42:32,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-01 22:42:32,955 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:100, output treesize:158 [2018-12-01 22:42:33,124 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2018-12-01 22:42:33,241 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 93 [2018-12-01 22:42:33,244 INFO L478 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 24 treesize of output 1 [2018-12-01 22:42:33,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:33,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:34,141 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 83 [2018-12-01 22:42:34,144 INFO L478 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 24 treesize of output 1 [2018-12-01 22:42:34,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:34,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:34,648 INFO L478 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 3 case distinctions, treesize of input 59 treesize of output 62 [2018-12-01 22:42:34,652 INFO L478 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 60 treesize of output 36 [2018-12-01 22:42:34,652 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:34,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:34,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 57 [2018-12-01 22:42:34,734 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-01 22:42:34,773 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 22:42:35,048 INFO L478 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 0 case distinctions, treesize of input 69 treesize of output 63 [2018-12-01 22:42:35,051 INFO L478 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 24 treesize of output 1 [2018-12-01 22:42:35,052 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:35,061 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:35,243 INFO L478 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 0 case distinctions, treesize of input 106 treesize of output 100 [2018-12-01 22:42:35,247 INFO L478 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 24 treesize of output 1 [2018-12-01 22:42:35,247 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:35,265 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:35,366 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 64 [2018-12-01 22:42:35,369 INFO L478 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 24 treesize of output 1 [2018-12-01 22:42:35,369 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:35,379 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:35,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-01 22:42:35,434 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 10 variables, input treesize:301, output treesize:127 [2018-12-01 22:42:35,602 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-01 22:42:35,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:35,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:35,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:35,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-01 22:42:35,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:35,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:35,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:167, output treesize:42 [2018-12-01 22:42:35,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-01 22:42:35,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-01 22:42:35,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:35,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:35,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-12-01 22:42:35,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-12-01 22:42:35,838 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:35,841 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:35,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:35,846 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:9 [2018-12-01 22:42:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:42:35,927 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 22:42:35,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:42:35,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-01 22:42:35,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-01 22:42:35,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-01 22:42:35,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-12-01 22:42:35,930 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 17 states. [2018-12-01 22:42:36,709 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-12-01 22:42:36,984 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2018-12-01 22:42:38,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:42:38,171 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-01 22:42:38,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-01 22:42:38,172 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-12-01 22:42:38,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:42:38,172 INFO L225 Difference]: With dead ends: 45 [2018-12-01 22:42:38,172 INFO L226 Difference]: Without dead ends: 45 [2018-12-01 22:42:38,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2018-12-01 22:42:38,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-01 22:42:38,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-12-01 22:42:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-01 22:42:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-01 22:42:38,174 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 27 [2018-12-01 22:42:38,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:42:38,174 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-01 22:42:38,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-01 22:42:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-01 22:42:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 22:42:38,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:42:38,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:42:38,175 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-01 22:42:38,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:42:38,175 INFO L82 PathProgramCache]: Analyzing trace with hash 872195698, now seen corresponding path program 1 times [2018-12-01 22:42:38,175 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 22:42:38,175 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 22:42:38,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:42:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:42:38,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:42:38,352 INFO L478 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 [2018-12-01 22:42:38,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:38,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:38,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 22:42:38,382 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 22:42:38,385 INFO L478 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 8 treesize of output 7 [2018-12-01 22:42:38,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:38,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:38,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:38,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-12-01 22:42:38,449 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-12-01 22:42:38,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:38,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:38,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 38 treesize of output 57 [2018-12-01 22:42:38,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:38,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:38,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:38,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:46 [2018-12-01 22:42:38,601 INFO L478 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 69 treesize of output 70 [2018-12-01 22:42:38,611 INFO L478 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 68 treesize of output 48 [2018-12-01 22:42:38,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:38,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:38,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:38,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 50 [2018-12-01 22:42:38,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-01 22:42:38,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-01 22:42:38,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-01 22:42:38,777 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:100 [2018-12-01 22:42:40,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:40,941 INFO L478 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 0 case distinctions, treesize of input 53 treesize of output 57 [2018-12-01 22:42:40,944 INFO L478 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 24 treesize of output 1 [2018-12-01 22:42:40,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:40,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:41,070 INFO L478 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 54 treesize of output 59 [2018-12-01 22:42:41,075 INFO L478 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 55 treesize of output 31 [2018-12-01 22:42:41,075 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:41,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:41,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 46 [2018-12-01 22:42:41,151 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-01 22:42:41,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 22:42:41,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:41,257 INFO L478 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 0 case distinctions, treesize of input 73 treesize of output 77 [2018-12-01 22:42:41,260 INFO L478 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 24 treesize of output 1 [2018-12-01 22:42:41,260 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:41,270 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:41,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-01 22:42:41,304 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:181, output treesize:105 [2018-12-01 22:42:43,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:43,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:43,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:43,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 33 [2018-12-01 22:42:43,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:43,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:43,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:133, output treesize:36 [2018-12-01 22:42:43,718 INFO L478 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 43 treesize of output 31 [2018-12-01 22:42:43,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2018-12-01 22:42:43,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:43,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:43,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:43,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:4 [2018-12-01 22:42:43,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:43,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 21 [2018-12-01 22:42:43,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:43,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 22:42:43,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-01 22:42:43,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:42:43,871 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 22:42:43,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:42:43,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-01 22:42:43,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-01 22:42:43,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-01 22:42:43,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=370, Unknown=2, NotChecked=0, Total=420 [2018-12-01 22:42:43,874 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 21 states. [2018-12-01 22:42:46,868 WARN L180 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2018-12-01 22:42:51,784 WARN L180 SmtUtils]: Spent 4.83 s on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2018-12-01 22:42:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:42:53,054 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-01 22:42:53,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-01 22:42:53,054 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2018-12-01 22:42:53,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:42:53,055 INFO L225 Difference]: With dead ends: 44 [2018-12-01 22:42:53,055 INFO L226 Difference]: Without dead ends: 44 [2018-12-01 22:42:53,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=161, Invalid=1097, Unknown=2, NotChecked=0, Total=1260 [2018-12-01 22:42:53,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-01 22:42:53,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-12-01 22:42:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-01 22:42:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-01 22:42:53,056 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 32 [2018-12-01 22:42:53,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:42:53,056 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-01 22:42:53,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-01 22:42:53,056 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-01 22:42:53,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 22:42:53,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:42:53,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:42:53,057 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-01 22:42:53,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:42:53,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1268262954, now seen corresponding path program 1 times [2018-12-01 22:42:53,057 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 22:42:53,057 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 22:42:53,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:42:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:42:53,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:42:53,214 INFO L478 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 [2018-12-01 22:42:53,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:53,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:53,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 22:42:53,239 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 22:42:53,241 INFO L478 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 8 treesize of output 7 [2018-12-01 22:42:53,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:53,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:53,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:53,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-01 22:42:53,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:53,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:53,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-01 22:42:53,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:53,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:53,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-12-01 22:42:53,305 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-12-01 22:42:53,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:53,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 25 [2018-12-01 22:42:53,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:53,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:53,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:53,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-12-01 22:42:53,428 INFO L478 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 47 treesize of output 52 [2018-12-01 22:42:53,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:53,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:53,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 46 [2018-12-01 22:42:53,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-12-01 22:42:53,558 INFO L478 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 40 treesize of output 20 [2018-12-01 22:42:53,559 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:53,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 22:42:53,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 22:42:53,620 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:68 [2018-12-01 22:42:53,743 INFO L478 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 0 case distinctions, treesize of input 60 treesize of output 54 [2018-12-01 22:42:53,746 INFO L478 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 24 treesize of output 1 [2018-12-01 22:42:53,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:53,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:53,884 INFO L478 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 58 [2018-12-01 22:42:53,888 INFO L478 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 54 treesize of output 30 [2018-12-01 22:42:53,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:53,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:53,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 45 [2018-12-01 22:42:53,953 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-01 22:42:53,986 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 22:42:54,068 INFO L478 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 0 case distinctions, treesize of input 56 treesize of output 50 [2018-12-01 22:42:54,071 INFO L478 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 24 treesize of output 1 [2018-12-01 22:42:54,071 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:54,083 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:54,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-01 22:42:54,147 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:170, output treesize:84 [2018-12-01 22:42:54,212 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-01 22:42:54,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:54,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:54,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:54,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-01 22:42:54,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:54,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:54,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:29 [2018-12-01 22:42:54,419 INFO L478 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 31 treesize of output 23 [2018-12-01 22:42:54,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2018-12-01 22:42:54,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:54,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:54,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:42:54,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:16 [2018-12-01 22:42:54,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:42:54,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-12-01 22:42:54,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:54,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 22:42:54,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:16 [2018-12-01 22:42:54,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-01 22:42:54,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:42:54,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 22:42:54,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-12-01 22:42:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:42:54,639 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 22:42:54,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:42:54,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-01 22:42:54,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-01 22:42:54,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-01 22:42:54,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-12-01 22:42:54,643 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-12-01 22:42:55,397 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-12-01 22:42:55,645 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2018-12-01 22:42:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:42:56,863 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-01 22:42:56,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-01 22:42:56,863 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-12-01 22:42:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:42:56,864 INFO L225 Difference]: With dead ends: 44 [2018-12-01 22:42:56,864 INFO L226 Difference]: Without dead ends: 44 [2018-12-01 22:42:56,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=165, Invalid=1167, Unknown=0, NotChecked=0, Total=1332 [2018-12-01 22:42:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-01 22:42:56,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2018-12-01 22:42:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-01 22:42:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-01 22:42:56,865 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 33 [2018-12-01 22:42:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:42:56,866 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-01 22:42:56,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-01 22:42:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-01 22:42:56,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 22:42:56,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:42:56,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:42:56,866 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-01 22:42:56,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:42:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1243370469, now seen corresponding path program 1 times [2018-12-01 22:42:56,867 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 22:42:56,867 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd39aac9-260e-4517-b7da-e7a2318273aa/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 22:42:56,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:42:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:42:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:42:57,322 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 22:42:57,332 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-01 22:42:57,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 10:42:57 BoogieIcfgContainer [2018-12-01 22:42:57,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 22:42:57,342 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 22:42:57,342 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 22:42:57,342 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 22:42:57,342 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:41:33" (3/4) ... [2018-12-01 22:42:57,345 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 22:42:57,345 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 22:42:57,346 INFO L168 Benchmark]: Toolchain (without parser) took 84146.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 237.5 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -217.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2018-12-01 22:42:57,346 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:42:57,346 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.36 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 917.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-12-01 22:42:57,347 INFO L168 Benchmark]: Boogie Preprocessor took 59.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 917.9 MB in the beginning and 1.1 GB in the end (delta: -207.4 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-12-01 22:42:57,347 INFO L168 Benchmark]: RCFGBuilder took 338.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. [2018-12-01 22:42:57,347 INFO L168 Benchmark]: TraceAbstraction took 83510.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 100.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-12-01 22:42:57,347 INFO L168 Benchmark]: Witness Printer took 3.62 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:42:57,348 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 231.36 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 917.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 917.9 MB in the beginning and 1.1 GB in the end (delta: -207.4 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 338.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 83510.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 100.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.62 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] TData data; VAL [data={-1340582773:0}] [L643] CALL alloc_data(&data) VAL [pdata={-1340582773:0}] [L625] pdata->lo = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={-1323805559:0}, pdata={-1340582773:0}, pdata={-1340582773:0}] [L626] pdata->hi = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={-1323805686:0}, malloc(sizeof(int))={-1323805559:0}, pdata={-1340582773:0}, pdata={-1340582773:0}] [L627] EXPR pdata->lo VAL [malloc(sizeof(int))={-1323805686:0}, malloc(sizeof(int))={-1323805559:0}, pdata={-1340582773:0}, pdata={-1340582773:0}, pdata->lo={-1323805559:0}] [L627] *(pdata->lo) = 4 VAL [malloc(sizeof(int))={-1323805686:0}, malloc(sizeof(int))={-1323805559:0}, pdata={-1340582773:0}, pdata={-1340582773:0}, pdata->lo={-1323805559:0}] [L628] EXPR pdata->hi VAL [malloc(sizeof(int))={-1323805559:0}, malloc(sizeof(int))={-1323805686:0}, pdata={-1340582773:0}, pdata={-1340582773:0}, pdata->hi={-1323805686:0}] [L628] *(pdata->hi) = 8 VAL [malloc(sizeof(int))={-1323805686:0}, malloc(sizeof(int))={-1323805559:0}, pdata={-1340582773:0}, pdata={-1340582773:0}, pdata->hi={-1323805686:0}] [L643] RET alloc_data(&data) VAL [data={-1340582773:0}] [L644] CALL free_data(&data) VAL [data={-1340582773:0}] [L632] EXPR data->lo VAL [data={-1340582773:0}, data={-1340582773:0}, data->lo={-1323805559:0}] [L632] int *lo = data->lo; [L633] EXPR data->hi VAL [data={-1340582773:0}, data={-1340582773:0}, data->hi={-1323805686:0}, lo={-1323805559:0}] [L633] int *hi = data->hi; [L634] EXPR \read(*lo) VAL [\read(*lo)=4, data={-1340582773:0}, data={-1340582773:0}, hi={-1323805686:0}, lo={-1323805559:0}] [L634] EXPR \read(*hi) VAL [\read(*hi)=8, \read(*lo)=4, data={-1340582773:0}, data={-1340582773:0}, hi={-1323805686:0}, lo={-1323805559:0}] [L634] COND FALSE !(*lo >= *hi) [L638] data->lo = ((void *)0) VAL [data={-1340582773:0}, data={-1340582773:0}, hi={-1323805686:0}, lo={-1323805559:0}] [L639] data->hi = ((void *)0) VAL [data={-1340582773:0}, data={-1340582773:0}, hi={-1323805686:0}, lo={-1323805559:0}] [L644] RET free_data(&data) VAL [data={-1340582773:0}] [L645] return 0; [L645] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 70 locations, 29 error locations. UNSAFE Result, 83.4s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 55.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 495 SDtfs, 626 SDslu, 2145 SDs, 0 SdLazy, 3324 SolverSat, 212 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 399 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 53.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 26 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 25.6s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 287 ConstructedInterpolants, 33 QuantifiedInterpolants, 195500 SizeOfPredicates, 154 NumberOfNonLiveVariables, 1517 ConjunctsInSsa, 319 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...