./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-properties/list_true-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/list-properties/list_true-unreach-call_false-valid-memtrack.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 45292d949331e02d780a7679ac12098a89a953bb ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/list-properties/list_true-unreach-call_false-valid-memtrack.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 45292d949331e02d780a7679ac12098a89a953bb ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 23:29:19,409 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 23:29:19,411 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 23:29:19,423 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 23:29:19,423 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 23:29:19,424 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 23:29:19,425 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 23:29:19,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 23:29:19,429 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 23:29:19,430 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 23:29:19,431 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 23:29:19,432 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 23:29:19,432 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 23:29:19,433 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 23:29:19,435 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 23:29:19,436 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 23:29:19,437 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 23:29:19,443 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 23:29:19,445 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 23:29:19,447 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 23:29:19,448 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 23:29:19,449 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 23:29:19,452 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 23:29:19,452 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 23:29:19,452 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 23:29:19,453 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 23:29:19,455 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 23:29:19,456 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 23:29:19,456 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 23:29:19,458 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 23:29:19,458 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 23:29:19,459 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 23:29:19,459 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 23:29:19,460 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 23:29:19,461 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 23:29:19,461 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 23:29:19,462 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 23:29:19,477 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 23:29:19,477 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 23:29:19,478 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 23:29:19,479 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 23:29:19,479 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 23:29:19,479 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 23:29:19,480 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 23:29:19,480 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 23:29:19,480 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 23:29:19,480 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 23:29:19,480 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 23:29:19,480 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 23:29:19,481 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 23:29:19,481 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 23:29:19,481 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 23:29:19,481 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 23:29:19,481 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 23:29:19,482 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 23:29:19,483 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 23:29:19,483 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 23:29:19,484 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 23:29:19,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 23:29:19,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 23:29:19,484 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 23:29:19,485 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 23:29:19,485 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 23:29:19,485 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 45292d949331e02d780a7679ac12098a89a953bb [2019-01-13 23:29:19,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 23:29:19,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 23:29:19,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 23:29:19,558 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 23:29:19,559 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 23:29:19,560 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-properties/list_true-unreach-call_false-valid-memtrack.i [2019-01-13 23:29:19,618 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca58a587/76e9159eb930420983bec3d7649bffa3/FLAG1f60a0534 [2019-01-13 23:29:20,118 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 23:29:20,118 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-properties/list_true-unreach-call_false-valid-memtrack.i [2019-01-13 23:29:20,141 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca58a587/76e9159eb930420983bec3d7649bffa3/FLAG1f60a0534 [2019-01-13 23:29:20,419 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca58a587/76e9159eb930420983bec3d7649bffa3 [2019-01-13 23:29:20,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 23:29:20,425 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 23:29:20,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 23:29:20,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 23:29:20,431 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 23:29:20,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:29:20" (1/1) ... [2019-01-13 23:29:20,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd7a4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:20, skipping insertion in model container [2019-01-13 23:29:20,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:29:20" (1/1) ... [2019-01-13 23:29:20,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 23:29:20,490 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 23:29:20,863 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:29:20,880 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 23:29:20,928 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:29:21,070 INFO L195 MainTranslator]: Completed translation [2019-01-13 23:29:21,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:21 WrapperNode [2019-01-13 23:29:21,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 23:29:21,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 23:29:21,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 23:29:21,074 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 23:29:21,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:21" (1/1) ... [2019-01-13 23:29:21,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:21" (1/1) ... [2019-01-13 23:29:21,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:21" (1/1) ... [2019-01-13 23:29:21,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:21" (1/1) ... [2019-01-13 23:29:21,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:21" (1/1) ... [2019-01-13 23:29:21,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:21" (1/1) ... [2019-01-13 23:29:21,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:21" (1/1) ... [2019-01-13 23:29:21,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 23:29:21,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 23:29:21,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 23:29:21,137 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 23:29:21,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 23:29:21,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 23:29:21,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 23:29:21,194 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-13 23:29:21,194 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 23:29:21,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 23:29:21,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 23:29:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 23:29:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 23:29:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 23:29:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 23:29:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 23:29:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 23:29:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 23:29:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 23:29:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 23:29:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 23:29:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 23:29:21,197 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 23:29:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 23:29:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 23:29:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 23:29:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 23:29:21,202 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 23:29:21,202 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 23:29:21,202 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 23:29:21,202 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 23:29:21,202 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 23:29:21,202 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 23:29:21,202 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 23:29:21,203 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 23:29:21,203 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 23:29:21,204 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 23:29:21,204 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 23:29:21,204 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 23:29:21,205 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 23:29:21,205 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 23:29:21,205 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 23:29:21,205 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 23:29:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 23:29:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 23:29:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 23:29:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 23:29:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 23:29:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 23:29:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 23:29:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 23:29:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 23:29:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 23:29:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 23:29:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 23:29:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 23:29:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 23:29:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 23:29:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 23:29:21,208 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 23:29:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 23:29:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 23:29:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 23:29:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 23:29:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 23:29:21,211 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 23:29:21,211 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 23:29:21,211 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 23:29:21,212 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 23:29:21,212 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 23:29:21,212 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 23:29:21,212 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 23:29:21,212 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 23:29:21,212 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 23:29:21,212 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 23:29:21,213 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-13 23:29:21,213 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 23:29:21,213 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 23:29:21,213 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 23:29:21,213 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 23:29:21,213 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 23:29:21,213 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 23:29:21,213 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 23:29:21,213 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 23:29:21,214 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 23:29:21,216 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 23:29:21,216 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 23:29:21,216 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 23:29:21,216 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 23:29:21,216 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 23:29:21,216 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 23:29:21,216 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 23:29:21,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 23:29:21,218 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 23:29:21,218 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 23:29:21,218 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 23:29:21,218 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 23:29:21,218 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 23:29:21,218 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 23:29:21,218 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 23:29:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 23:29:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 23:29:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 23:29:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 23:29:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 23:29:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 23:29:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 23:29:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 23:29:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 23:29:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 23:29:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 23:29:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 23:29:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-13 23:29:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 23:29:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 23:29:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 23:29:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 23:29:21,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 23:29:21,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 23:29:21,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 23:29:21,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 23:29:21,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 23:29:21,656 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-13 23:29:22,203 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 23:29:22,203 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-13 23:29:22,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:29:22 BoogieIcfgContainer [2019-01-13 23:29:22,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 23:29:22,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 23:29:22,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 23:29:22,210 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 23:29:22,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 11:29:20" (1/3) ... [2019-01-13 23:29:22,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92d1a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:29:22, skipping insertion in model container [2019-01-13 23:29:22,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:21" (2/3) ... [2019-01-13 23:29:22,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92d1a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:29:22, skipping insertion in model container [2019-01-13 23:29:22,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:29:22" (3/3) ... [2019-01-13 23:29:22,214 INFO L112 eAbstractionObserver]: Analyzing ICFG list_true-unreach-call_false-valid-memtrack.i [2019-01-13 23:29:22,224 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 23:29:22,233 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2019-01-13 23:29:22,247 INFO L257 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2019-01-13 23:29:22,276 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 23:29:22,276 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 23:29:22,277 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 23:29:22,277 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 23:29:22,277 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 23:29:22,277 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 23:29:22,277 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 23:29:22,277 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 23:29:22,278 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 23:29:22,296 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2019-01-13 23:29:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 23:29:22,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:22,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:22,310 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-01-13 23:29:22,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:22,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2132532229, now seen corresponding path program 1 times [2019-01-13 23:29:22,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:29:22,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:29:22,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:22,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:22,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:22,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:22,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:22,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 23:29:22,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 23:29:22,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 23:29:22,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 23:29:22,550 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 4 states. [2019-01-13 23:29:23,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:23,042 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2019-01-13 23:29:23,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 23:29:23,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-13 23:29:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:23,057 INFO L225 Difference]: With dead ends: 79 [2019-01-13 23:29:23,057 INFO L226 Difference]: Without dead ends: 70 [2019-01-13 23:29:23,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:29:23,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-13 23:29:23,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-01-13 23:29:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-13 23:29:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-01-13 23:29:23,104 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 11 [2019-01-13 23:29:23,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:23,104 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-01-13 23:29:23,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 23:29:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-01-13 23:29:23,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 23:29:23,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:23,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:23,105 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-01-13 23:29:23,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:23,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2132532228, now seen corresponding path program 1 times [2019-01-13 23:29:23,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:29:23,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:29:23,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:23,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:23,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:23,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:23,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 23:29:23,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 23:29:23,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 23:29:23,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 23:29:23,197 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 4 states. [2019-01-13 23:29:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:23,595 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2019-01-13 23:29:23,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 23:29:23,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-13 23:29:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:23,598 INFO L225 Difference]: With dead ends: 88 [2019-01-13 23:29:23,599 INFO L226 Difference]: Without dead ends: 88 [2019-01-13 23:29:23,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:29:23,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-13 23:29:23,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2019-01-13 23:29:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-13 23:29:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2019-01-13 23:29:23,610 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 11 [2019-01-13 23:29:23,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:23,610 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2019-01-13 23:29:23,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 23:29:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2019-01-13 23:29:23,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 23:29:23,611 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:23,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:23,612 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-01-13 23:29:23,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:23,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2029512520, now seen corresponding path program 1 times [2019-01-13 23:29:23,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:29:23,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:29:23,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:23,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:23,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:24,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:24,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:24,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 23:29:24,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:29:24,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:29:24,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:29:24,029 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 6 states. [2019-01-13 23:29:24,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:24,306 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-01-13 23:29:24,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:29:24,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-13 23:29:24,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:24,309 INFO L225 Difference]: With dead ends: 112 [2019-01-13 23:29:24,310 INFO L226 Difference]: Without dead ends: 112 [2019-01-13 23:29:24,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:29:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-13 23:29:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 82. [2019-01-13 23:29:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-13 23:29:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2019-01-13 23:29:24,319 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 19 [2019-01-13 23:29:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:24,320 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2019-01-13 23:29:24,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:29:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2019-01-13 23:29:24,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 23:29:24,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:24,321 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:24,322 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-01-13 23:29:24,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:24,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1001615762, now seen corresponding path program 1 times [2019-01-13 23:29:24,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:29:24,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:29:24,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:24,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:24,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:24,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:24,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:29:24,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:29:24,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:29:24,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:29:24,454 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 6 states. [2019-01-13 23:29:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:24,798 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2019-01-13 23:29:24,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:29:24,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-13 23:29:24,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:24,802 INFO L225 Difference]: With dead ends: 105 [2019-01-13 23:29:24,802 INFO L226 Difference]: Without dead ends: 105 [2019-01-13 23:29:24,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 23:29:24,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-13 23:29:24,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2019-01-13 23:29:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-13 23:29:24,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2019-01-13 23:29:24,813 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 19 [2019-01-13 23:29:24,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:24,814 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2019-01-13 23:29:24,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:29:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2019-01-13 23:29:24,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 23:29:24,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:24,815 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:24,816 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-01-13 23:29:24,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:24,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1001615761, now seen corresponding path program 1 times [2019-01-13 23:29:24,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:29:24,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:29:24,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:24,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:24,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:24,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:24,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:29:24,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:29:24,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:29:24,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:29:24,969 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 6 states. [2019-01-13 23:29:25,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:25,841 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2019-01-13 23:29:25,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:29:25,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-13 23:29:25,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:25,844 INFO L225 Difference]: With dead ends: 106 [2019-01-13 23:29:25,845 INFO L226 Difference]: Without dead ends: 106 [2019-01-13 23:29:25,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-13 23:29:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-13 23:29:25,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2019-01-13 23:29:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-13 23:29:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2019-01-13 23:29:25,852 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 19 [2019-01-13 23:29:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:25,853 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2019-01-13 23:29:25,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:29:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2019-01-13 23:29:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 23:29:25,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:25,854 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] [2019-01-13 23:29:25,854 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-01-13 23:29:25,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:25,855 INFO L82 PathProgramCache]: Analyzing trace with hash 398800981, now seen corresponding path program 1 times [2019-01-13 23:29:25,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:29:25,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:29:25,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:25,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:25,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:25,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:25,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:25,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 23:29:25,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:29:25,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:29:25,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:29:25,952 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 6 states. [2019-01-13 23:29:26,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:26,186 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2019-01-13 23:29:26,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:29:26,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-13 23:29:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:26,189 INFO L225 Difference]: With dead ends: 101 [2019-01-13 23:29:26,189 INFO L226 Difference]: Without dead ends: 101 [2019-01-13 23:29:26,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:29:26,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-13 23:29:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2019-01-13 23:29:26,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-13 23:29:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2019-01-13 23:29:26,196 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 21 [2019-01-13 23:29:26,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:26,196 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2019-01-13 23:29:26,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:29:26,196 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2019-01-13 23:29:26,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 23:29:26,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:26,197 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:26,198 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-01-13 23:29:26,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:26,198 INFO L82 PathProgramCache]: Analyzing trace with hash 102986752, now seen corresponding path program 1 times [2019-01-13 23:29:26,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:29:26,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:29:26,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:26,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:26,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:26,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:26,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:29:26,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:29:26,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:29:26,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:29:26,288 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 6 states. [2019-01-13 23:29:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:26,507 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2019-01-13 23:29:26,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:29:26,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-13 23:29:26,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:26,509 INFO L225 Difference]: With dead ends: 86 [2019-01-13 23:29:26,509 INFO L226 Difference]: Without dead ends: 86 [2019-01-13 23:29:26,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 23:29:26,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-13 23:29:26,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-01-13 23:29:26,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-13 23:29:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2019-01-13 23:29:26,518 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 21 [2019-01-13 23:29:26,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:26,518 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2019-01-13 23:29:26,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:29:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2019-01-13 23:29:26,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 23:29:26,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:26,520 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:26,520 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-01-13 23:29:26,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:26,520 INFO L82 PathProgramCache]: Analyzing trace with hash 102986753, now seen corresponding path program 1 times [2019-01-13 23:29:26,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:29:26,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:29:26,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:26,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:26,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:26,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:26,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:29:26,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:29:26,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:29:26,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:29:26,810 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 6 states. [2019-01-13 23:29:27,321 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-13 23:29:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:27,441 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2019-01-13 23:29:27,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:29:27,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-13 23:29:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:27,442 INFO L225 Difference]: With dead ends: 83 [2019-01-13 23:29:27,442 INFO L226 Difference]: Without dead ends: 83 [2019-01-13 23:29:27,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-13 23:29:27,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-13 23:29:27,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2019-01-13 23:29:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-13 23:29:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2019-01-13 23:29:27,448 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 21 [2019-01-13 23:29:27,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:27,449 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2019-01-13 23:29:27,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:29:27,449 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2019-01-13 23:29:27,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 23:29:27,450 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:27,450 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] [2019-01-13 23:29:27,450 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-01-13 23:29:27,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:27,450 INFO L82 PathProgramCache]: Analyzing trace with hash -523696583, now seen corresponding path program 1 times [2019-01-13 23:29:27,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:29:27,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:29:27,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:27,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:27,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:29:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 23:29:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 23:29:27,497 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 23:29:27,508 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-13 23:29:27,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 11:29:27 BoogieIcfgContainer [2019-01-13 23:29:27,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 23:29:27,521 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 23:29:27,521 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 23:29:27,521 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 23:29:27,521 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:29:22" (3/4) ... [2019-01-13 23:29:27,526 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-13 23:29:27,526 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 23:29:27,527 INFO L168 Benchmark]: Toolchain (without parser) took 7102.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -220.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:29:27,528 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:29:27,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -203.6 MB). Peak memory consumption was 42.7 MB. Max. memory is 11.5 GB. [2019-01-13 23:29:27,529 INFO L168 Benchmark]: Boogie Preprocessor took 62.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-01-13 23:29:27,530 INFO L168 Benchmark]: RCFGBuilder took 1068.49 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: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. [2019-01-13 23:29:27,531 INFO L168 Benchmark]: TraceAbstraction took 5314.37 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -71.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:29:27,531 INFO L168 Benchmark]: Witness Printer took 5.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:29:27,536 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 644.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -203.6 MB). Peak memory consumption was 42.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1068.49 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: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5314.37 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -71.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.45 ms. Allocated memory is still 1.2 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: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible FailurePath: [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L628] COND FALSE !(a == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L629] List t; [L630] List p = a; VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L645] p->h = 3 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L646] p = a VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L647] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=3] [L647] COND FALSE !(p->h == 1) [L649] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=3] [L649] COND FALSE !(p->h == 2) [L651] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=3] [L651] COND FALSE !(p->h != 3) [L653] return 0; VAL [\result=0, a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 73 locations, 25 error locations. UNSAFE Result, 5.2s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 349 SDtfs, 596 SDslu, 757 SDs, 0 SdLazy, 1010 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=4, 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, 8 MinimizatonAttempts, 146 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 8760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 12/12 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.24-0ed9222-m [2019-01-13 23:29:29,810 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 23:29:29,812 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 23:29:29,824 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 23:29:29,824 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 23:29:29,825 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 23:29:29,826 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 23:29:29,828 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 23:29:29,830 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 23:29:29,831 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 23:29:29,831 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 23:29:29,832 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 23:29:29,833 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 23:29:29,834 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 23:29:29,835 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 23:29:29,835 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 23:29:29,836 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 23:29:29,838 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 23:29:29,840 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 23:29:29,842 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 23:29:29,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 23:29:29,845 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 23:29:29,847 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 23:29:29,847 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 23:29:29,848 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 23:29:29,849 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 23:29:29,850 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 23:29:29,850 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 23:29:29,851 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 23:29:29,852 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 23:29:29,853 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 23:29:29,853 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 23:29:29,853 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 23:29:29,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 23:29:29,855 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 23:29:29,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 23:29:29,856 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-13 23:29:29,871 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 23:29:29,871 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 23:29:29,872 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 23:29:29,873 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 23:29:29,873 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 23:29:29,873 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 23:29:29,873 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 23:29:29,873 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 23:29:29,874 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 23:29:29,874 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 23:29:29,874 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 23:29:29,874 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 23:29:29,874 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 23:29:29,874 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 23:29:29,875 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 23:29:29,875 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-13 23:29:29,875 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-13 23:29:29,875 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 23:29:29,875 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 23:29:29,876 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 23:29:29,876 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 23:29:29,876 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 23:29:29,876 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 23:29:29,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 23:29:29,877 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 23:29:29,877 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 23:29:29,877 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-13 23:29:29,877 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 23:29:29,877 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-13 23:29:29,877 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 45292d949331e02d780a7679ac12098a89a953bb [2019-01-13 23:29:29,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 23:29:29,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 23:29:29,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 23:29:29,941 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 23:29:29,942 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 23:29:29,943 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-properties/list_true-unreach-call_false-valid-memtrack.i [2019-01-13 23:29:30,011 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f38a25d/ff03f5fb6e814df89223671d94f71cf5/FLAGd4fa72adc [2019-01-13 23:29:30,485 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 23:29:30,485 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-properties/list_true-unreach-call_false-valid-memtrack.i [2019-01-13 23:29:30,498 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f38a25d/ff03f5fb6e814df89223671d94f71cf5/FLAGd4fa72adc [2019-01-13 23:29:30,811 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f38a25d/ff03f5fb6e814df89223671d94f71cf5 [2019-01-13 23:29:30,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 23:29:30,816 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 23:29:30,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 23:29:30,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 23:29:30,821 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 23:29:30,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:29:30" (1/1) ... [2019-01-13 23:29:30,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e2c51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:30, skipping insertion in model container [2019-01-13 23:29:30,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:29:30" (1/1) ... [2019-01-13 23:29:30,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 23:29:30,878 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 23:29:31,212 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:29:31,232 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 23:29:31,301 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:29:31,436 INFO L195 MainTranslator]: Completed translation [2019-01-13 23:29:31,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31 WrapperNode [2019-01-13 23:29:31,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 23:29:31,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 23:29:31,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 23:29:31,438 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 23:29:31,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (1/1) ... [2019-01-13 23:29:31,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (1/1) ... [2019-01-13 23:29:31,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (1/1) ... [2019-01-13 23:29:31,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (1/1) ... [2019-01-13 23:29:31,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (1/1) ... [2019-01-13 23:29:31,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (1/1) ... [2019-01-13 23:29:31,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (1/1) ... [2019-01-13 23:29:31,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 23:29:31,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 23:29:31,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 23:29:31,509 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 23:29:31,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 23:29:31,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 23:29:31,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 23:29:31,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 23:29:31,562 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-13 23:29:31,562 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 23:29:31,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 23:29:31,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 23:29:31,562 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 23:29:31,562 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 23:29:31,563 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 23:29:31,563 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 23:29:31,563 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 23:29:31,563 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 23:29:31,563 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 23:29:31,563 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 23:29:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 23:29:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 23:29:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 23:29:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 23:29:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 23:29:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 23:29:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 23:29:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 23:29:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 23:29:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 23:29:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 23:29:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 23:29:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 23:29:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 23:29:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 23:29:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 23:29:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 23:29:31,568 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 23:29:31,568 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 23:29:31,568 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 23:29:31,568 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 23:29:31,568 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 23:29:31,568 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 23:29:31,570 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 23:29:31,571 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 23:29:31,571 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 23:29:31,571 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 23:29:31,571 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 23:29:31,571 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 23:29:31,571 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 23:29:31,572 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 23:29:31,572 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 23:29:31,572 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 23:29:31,572 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 23:29:31,572 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 23:29:31,572 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 23:29:31,572 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 23:29:31,573 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 23:29:31,573 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 23:29:31,573 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 23:29:31,573 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 23:29:31,573 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 23:29:31,573 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 23:29:31,574 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 23:29:31,574 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 23:29:31,574 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 23:29:31,574 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 23:29:31,574 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 23:29:31,574 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 23:29:31,574 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 23:29:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 23:29:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 23:29:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 23:29:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 23:29:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 23:29:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 23:29:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-13 23:29:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 23:29:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 23:29:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 23:29:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 23:29:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 23:29:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 23:29:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 23:29:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 23:29:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 23:29:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 23:29:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 23:29:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 23:29:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 23:29:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 23:29:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 23:29:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 23:29:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 23:29:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 23:29:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 23:29:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 23:29:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 23:29:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 23:29:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 23:29:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 23:29:31,581 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 23:29:31,582 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 23:29:31,582 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 23:29:31,582 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 23:29:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 23:29:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 23:29:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 23:29:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 23:29:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 23:29:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 23:29:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 23:29:31,584 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 23:29:31,584 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-13 23:29:31,584 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 23:29:31,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 23:29:31,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-13 23:29:31,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 23:29:31,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 23:29:31,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-13 23:29:31,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 23:29:31,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 23:29:31,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 23:29:31,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 23:29:31,954 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-13 23:29:32,596 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 23:29:32,597 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-13 23:29:32,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:29:32 BoogieIcfgContainer [2019-01-13 23:29:32,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 23:29:32,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 23:29:32,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 23:29:32,602 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 23:29:32,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 11:29:30" (1/3) ... [2019-01-13 23:29:32,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb30a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:29:32, skipping insertion in model container [2019-01-13 23:29:32,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:29:31" (2/3) ... [2019-01-13 23:29:32,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb30a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:29:32, skipping insertion in model container [2019-01-13 23:29:32,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:29:32" (3/3) ... [2019-01-13 23:29:32,606 INFO L112 eAbstractionObserver]: Analyzing ICFG list_true-unreach-call_false-valid-memtrack.i [2019-01-13 23:29:32,616 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 23:29:32,624 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2019-01-13 23:29:32,639 INFO L257 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2019-01-13 23:29:32,665 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 23:29:32,666 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 23:29:32,666 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 23:29:32,667 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 23:29:32,667 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 23:29:32,667 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 23:29:32,667 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 23:29:32,667 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 23:29:32,667 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 23:29:32,686 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-01-13 23:29:32,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 23:29:32,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:32,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:32,700 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-13 23:29:32,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:32,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2113645311, now seen corresponding path program 1 times [2019-01-13 23:29:32,711 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:29:32,711 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:29:32,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:32,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:29:32,849 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 [2019-01-13 23:29:32,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:32,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:32,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 23:29:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:32,952 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:29:32,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:32,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 23:29:32,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 23:29:32,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 23:29:32,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 23:29:32,975 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 4 states. [2019-01-13 23:29:33,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:33,830 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-01-13 23:29:33,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 23:29:33,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 23:29:33,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:33,843 INFO L225 Difference]: With dead ends: 75 [2019-01-13 23:29:33,843 INFO L226 Difference]: Without dead ends: 66 [2019-01-13 23:29:33,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:29:33,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-13 23:29:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2019-01-13 23:29:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-13 23:29:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-01-13 23:29:33,880 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 10 [2019-01-13 23:29:33,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:33,880 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-01-13 23:29:33,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 23:29:33,881 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2019-01-13 23:29:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 23:29:33,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:33,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:33,882 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-13 23:29:33,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:33,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2113645312, now seen corresponding path program 1 times [2019-01-13 23:29:33,883 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:29:33,883 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:29:33,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:33,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:29:33,950 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 [2019-01-13 23:29:33,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:33,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:33,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 23:29:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:34,000 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:29:34,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:34,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 23:29:34,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 23:29:34,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 23:29:34,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 23:29:34,011 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 4 states. [2019-01-13 23:29:34,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:34,839 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2019-01-13 23:29:34,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 23:29:34,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 23:29:34,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:34,842 INFO L225 Difference]: With dead ends: 84 [2019-01-13 23:29:34,842 INFO L226 Difference]: Without dead ends: 84 [2019-01-13 23:29:34,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:29:34,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-13 23:29:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2019-01-13 23:29:34,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-13 23:29:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-01-13 23:29:34,853 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 10 [2019-01-13 23:29:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:34,853 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-01-13 23:29:34,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 23:29:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2019-01-13 23:29:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 23:29:34,855 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:34,855 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:34,855 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-13 23:29:34,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:34,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1730022228, now seen corresponding path program 1 times [2019-01-13 23:29:34,856 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:29:34,856 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:29:34,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:34,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:29:35,020 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 [2019-01-13 23:29:35,024 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 [2019-01-13 23:29:35,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-13 23:29:35,074 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 17 treesize of output 13 [2019-01-13 23:29:35,082 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 13 treesize of output 5 [2019-01-13 23:29:35,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-01-13 23:29:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:35,109 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:29:35,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:35,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 23:29:35,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 23:29:35,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 23:29:35,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:29:35,113 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 7 states. [2019-01-13 23:29:35,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:35,800 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2019-01-13 23:29:35,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:29:35,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-01-13 23:29:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:35,806 INFO L225 Difference]: With dead ends: 108 [2019-01-13 23:29:35,806 INFO L226 Difference]: Without dead ends: 108 [2019-01-13 23:29:35,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 23:29:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-13 23:29:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 78. [2019-01-13 23:29:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-13 23:29:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2019-01-13 23:29:35,817 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 17 [2019-01-13 23:29:35,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:35,818 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2019-01-13 23:29:35,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 23:29:35,818 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2019-01-13 23:29:35,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 23:29:35,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:35,821 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:35,822 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-13 23:29:35,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:35,822 INFO L82 PathProgramCache]: Analyzing trace with hash -20971988, now seen corresponding path program 1 times [2019-01-13 23:29:35,824 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:29:35,828 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:29:35,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:35,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:29:35,930 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 [2019-01-13 23:29:35,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:35,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-13 23:29:35,997 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 [2019-01-13 23:29:36,011 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 [2019-01-13 23:29:36,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:36,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:36,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:36,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-01-13 23:29:36,129 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 21 treesize of output 17 [2019-01-13 23:29:36,135 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 17 treesize of output 5 [2019-01-13 23:29:36,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:36,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:36,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:29:36,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-01-13 23:29:36,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:36,213 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:29:36,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:36,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:29:36,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:29:36,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:29:36,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:29:36,216 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 6 states. [2019-01-13 23:29:36,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:36,803 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2019-01-13 23:29:36,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:29:36,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-13 23:29:36,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:36,806 INFO L225 Difference]: With dead ends: 85 [2019-01-13 23:29:36,807 INFO L226 Difference]: Without dead ends: 85 [2019-01-13 23:29:36,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:29:36,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-13 23:29:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2019-01-13 23:29:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-13 23:29:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2019-01-13 23:29:36,815 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 17 [2019-01-13 23:29:36,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:36,815 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2019-01-13 23:29:36,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:29:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2019-01-13 23:29:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 23:29:36,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:36,817 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:36,818 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-13 23:29:36,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:36,818 INFO L82 PathProgramCache]: Analyzing trace with hash -20971987, now seen corresponding path program 1 times [2019-01-13 23:29:36,819 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:29:36,819 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:29:36,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:36,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:29:36,911 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 [2019-01-13 23:29:36,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:36,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:36,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 23:29:36,952 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 [2019-01-13 23:29:36,957 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 [2019-01-13 23:29:36,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:36,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:36,990 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 [2019-01-13 23:29:36,999 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 [2019-01-13 23:29:36,999 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:37,003 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:37,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:37,035 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-01-13 23:29:37,077 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 19 treesize of output 15 [2019-01-13 23:29:37,087 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 15 treesize of output 3 [2019-01-13 23:29:37,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:37,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:37,115 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 23 treesize of output 19 [2019-01-13 23:29:37,132 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 19 treesize of output 7 [2019-01-13 23:29:37,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:37,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:37,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:37,147 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-01-13 23:29:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:37,188 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:29:37,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:37,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:29:37,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:29:37,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:29:37,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:29:37,192 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 6 states. [2019-01-13 23:29:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:38,273 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2019-01-13 23:29:38,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:29:38,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-13 23:29:38,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:38,277 INFO L225 Difference]: With dead ends: 101 [2019-01-13 23:29:38,277 INFO L226 Difference]: Without dead ends: 101 [2019-01-13 23:29:38,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-13 23:29:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-13 23:29:38,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 71. [2019-01-13 23:29:38,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-13 23:29:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-01-13 23:29:38,286 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 17 [2019-01-13 23:29:38,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:38,287 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-01-13 23:29:38,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:29:38,287 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-01-13 23:29:38,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 23:29:38,292 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:38,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:38,292 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-13 23:29:38,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:38,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1522226179, now seen corresponding path program 1 times [2019-01-13 23:29:38,294 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:29:38,294 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:29:38,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:38,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:29:38,387 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 [2019-01-13 23:29:38,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:38,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:38,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-13 23:29:38,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 [2019-01-13 23:29:38,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 10 treesize of output 9 [2019-01-13 23:29:38,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:38,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:38,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:38,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-01-13 23:29:38,494 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 21 treesize of output 17 [2019-01-13 23:29:38,501 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 17 treesize of output 5 [2019-01-13 23:29:38,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:38,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:38,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:29:38,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-01-13 23:29:38,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:38,533 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:29:38,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:38,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:29:38,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:29:38,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:29:38,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:29:38,539 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 6 states. [2019-01-13 23:29:39,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:39,027 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2019-01-13 23:29:39,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:29:39,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-13 23:29:39,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:39,029 INFO L225 Difference]: With dead ends: 71 [2019-01-13 23:29:39,029 INFO L226 Difference]: Without dead ends: 71 [2019-01-13 23:29:39,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:29:39,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-13 23:29:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-01-13 23:29:39,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-13 23:29:39,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2019-01-13 23:29:39,034 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 18 [2019-01-13 23:29:39,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:39,035 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2019-01-13 23:29:39,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:29:39,035 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2019-01-13 23:29:39,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 23:29:39,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:39,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:39,036 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-13 23:29:39,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:39,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1522226178, now seen corresponding path program 1 times [2019-01-13 23:29:39,037 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:29:39,037 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:29:39,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:39,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:29:39,127 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 [2019-01-13 23:29:39,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:39,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:39,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 23:29:39,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 13 treesize of output 10 [2019-01-13 23:29:39,173 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 [2019-01-13 23:29:39,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:39,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:39,228 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 [2019-01-13 23:29:39,240 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 [2019-01-13 23:29:39,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:39,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:39,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:39,370 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-01-13 23:29:39,406 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 19 treesize of output 15 [2019-01-13 23:29:39,410 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 15 treesize of output 3 [2019-01-13 23:29:39,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:39,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:39,431 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 23 treesize of output 19 [2019-01-13 23:29:39,436 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 19 treesize of output 7 [2019-01-13 23:29:39,436 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:39,439 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:39,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:39,447 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-01-13 23:29:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:39,481 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:29:39,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:39,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:29:39,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:29:39,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:29:39,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:29:39,484 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand 6 states. [2019-01-13 23:29:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:40,150 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2019-01-13 23:29:40,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:29:40,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-13 23:29:40,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:40,154 INFO L225 Difference]: With dead ends: 88 [2019-01-13 23:29:40,154 INFO L226 Difference]: Without dead ends: 88 [2019-01-13 23:29:40,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-13 23:29:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-13 23:29:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 58. [2019-01-13 23:29:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-13 23:29:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2019-01-13 23:29:40,159 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 18 [2019-01-13 23:29:40,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:40,159 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2019-01-13 23:29:40,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:29:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2019-01-13 23:29:40,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 23:29:40,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:40,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:29:40,162 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-13 23:29:40,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:40,163 INFO L82 PathProgramCache]: Analyzing trace with hash 351439361, now seen corresponding path program 1 times [2019-01-13 23:29:40,163 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:29:40,163 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:29:40,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:29:40,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:29:40,272 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 [2019-01-13 23:29:40,275 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 [2019-01-13 23:29:40,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:40,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:40,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:40,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-13 23:29:40,323 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 17 treesize of output 13 [2019-01-13 23:29:40,325 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 13 treesize of output 5 [2019-01-13 23:29:40,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:29:40,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:40,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:29:40,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-01-13 23:29:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:29:40,341 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:29:40,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:29:40,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 23:29:40,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 23:29:40,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 23:29:40,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:29:40,345 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 7 states. [2019-01-13 23:29:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:29:40,837 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2019-01-13 23:29:40,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:29:40,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-01-13 23:29:40,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:29:40,844 INFO L225 Difference]: With dead ends: 83 [2019-01-13 23:29:40,845 INFO L226 Difference]: Without dead ends: 83 [2019-01-13 23:29:40,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 23:29:40,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-13 23:29:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 60. [2019-01-13 23:29:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-13 23:29:40,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2019-01-13 23:29:40,852 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 19 [2019-01-13 23:29:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:29:40,853 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2019-01-13 23:29:40,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 23:29:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2019-01-13 23:29:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 23:29:40,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:29:40,854 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] [2019-01-13 23:29:40,854 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-01-13 23:29:40,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:29:40,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1991906798, now seen corresponding path program 1 times [2019-01-13 23:29:40,857 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:29:40,857 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:29:40,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:29:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 23:29:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 23:29:41,034 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 23:29:41,059 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-13 23:29:41,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 11:29:41 BoogieIcfgContainer [2019-01-13 23:29:41,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 23:29:41,102 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 23:29:41,103 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 23:29:41,103 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 23:29:41,105 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:29:32" (3/4) ... [2019-01-13 23:29:41,118 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-13 23:29:41,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 23:29:41,119 INFO L168 Benchmark]: Toolchain (without parser) took 10304.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -112.4 MB). Peak memory consumption was 99.5 MB. Max. memory is 11.5 GB. [2019-01-13 23:29:41,126 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:29:41,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 620.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2019-01-13 23:29:41,128 INFO L168 Benchmark]: Boogie Preprocessor took 70.75 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: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-01-13 23:29:41,128 INFO L168 Benchmark]: RCFGBuilder took 1089.25 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: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2019-01-13 23:29:41,135 INFO L168 Benchmark]: TraceAbstraction took 8502.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 78.2 MB. Max. memory is 11.5 GB. [2019-01-13 23:29:41,136 INFO L168 Benchmark]: Witness Printer took 15.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:29:41,145 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 620.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.75 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: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1089.25 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: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8502.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 78.2 MB. Max. memory is 11.5 GB. * Witness Printer took 15.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible FailurePath: [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}] [L628] COND FALSE !(a == 0) VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}] [L629] List t; [L630] List p = a; VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}, p={1073741824:0}] [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L645] p->h = 3 VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}, p={1073741824:0}] [L646] p = a VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}, p={1073741824:0}] [L647] EXPR p->h VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}, p={1073741824:0}, p->h=3] [L647] COND FALSE !(p->h == 1) [L649] EXPR p->h VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}, p={1073741824:0}, p->h=3] [L649] COND FALSE !(p->h == 2) [L651] EXPR p->h VAL [a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}, p={1073741824:0}, p->h=3] [L651] COND FALSE !(p->h != 3) [L653] return 0; VAL [\result=0, a={1073741824:0}, malloc(sizeof(struct node))={1073741824:0}, p={1073741824:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 74 locations, 25 error locations. UNSAFE Result, 8.4s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 310 SDtfs, 690 SDslu, 606 SDs, 0 SdLazy, 974 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=4, 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, 8 MinimizatonAttempts, 134 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 8828 SizeOfPredicates, 50 NumberOfNonLiveVariables, 512 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 8/8 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...