./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/memory-alloca/c.03-alloca-2.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 ab87ef7cc863b18816ae397a50b6c6e9fb3e753d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:37:18,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:37:18,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:37:18,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:37:18,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:37:18,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:37:18,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:37:18,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:37:18,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:37:18,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:37:18,329 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:37:18,330 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:37:18,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:37:18,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:37:18,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:37:18,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:37:18,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:37:18,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:37:18,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:37:18,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:37:18,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:37:18,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:37:18,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:37:18,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:37:18,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:37:18,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:37:18,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:37:18,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:37:18,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:37:18,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:37:18,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:37:18,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:37:18,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:37:18,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:37:18,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:37:18,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:37:18,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:37:18,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:37:18,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:37:18,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:37:18,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:37:18,379 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 02:37:18,397 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:37:18,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:37:18,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:37:18,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:37:18,399 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:37:18,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:37:18,399 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:37:18,400 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:37:18,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:37:18,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:37:18,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:37:18,401 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:37:18,401 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:37:18,401 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:37:18,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:37:18,402 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:37:18,402 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:37:18,403 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:37:18,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:37:18,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:37:18,403 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:37:18,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:37:18,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:37:18,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:37:18,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:37:18,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:37:18,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:37:18,405 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> ab87ef7cc863b18816ae397a50b6c6e9fb3e753d [2019-11-28 02:37:18,690 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:37:18,708 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:37:18,713 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:37:18,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:37:18,717 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:37:18,717 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2019-11-28 02:37:18,785 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609573e59/cfb39cf992dd477dab4f1c581c04c585/FLAGc24ad45f5 [2019-11-28 02:37:19,342 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:37:19,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2019-11-28 02:37:19,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609573e59/cfb39cf992dd477dab4f1c581c04c585/FLAGc24ad45f5 [2019-11-28 02:37:19,690 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609573e59/cfb39cf992dd477dab4f1c581c04c585 [2019-11-28 02:37:19,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:37:19,695 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:37:19,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:37:19,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:37:19,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:37:19,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:37:19" (1/1) ... [2019-11-28 02:37:19,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cdbcaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:19, skipping insertion in model container [2019-11-28 02:37:19,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:37:19" (1/1) ... [2019-11-28 02:37:19,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:37:19,748 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:37:20,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:37:20,196 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:37:20,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:37:20,325 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:37:20,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:20 WrapperNode [2019-11-28 02:37:20,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:37:20,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:37:20,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:37:20,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:37:20,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:20" (1/1) ... [2019-11-28 02:37:20,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:20" (1/1) ... [2019-11-28 02:37:20,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:20" (1/1) ... [2019-11-28 02:37:20,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:20" (1/1) ... [2019-11-28 02:37:20,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:20" (1/1) ... [2019-11-28 02:37:20,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:20" (1/1) ... [2019-11-28 02:37:20,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:20" (1/1) ... [2019-11-28 02:37:20,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:37:20,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:37:20,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:37:20,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:37:20,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:20" (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-11-28 02:37:20,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:37:20,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:37:20,445 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 02:37:20,445 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 02:37:20,445 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 02:37:20,445 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 02:37:20,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 02:37:20,446 INFO L138 BoogieDeclarations]: Found implementation of procedure test_fun [2019-11-28 02:37:20,446 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:37:20,446 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 02:37:20,446 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 02:37:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 02:37:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 02:37:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 02:37:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 02:37:20,448 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 02:37:20,448 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 02:37:20,448 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 02:37:20,448 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 02:37:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 02:37:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 02:37:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 02:37:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 02:37:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 02:37:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 02:37:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 02:37:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 02:37:20,451 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 02:37:20,451 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 02:37:20,451 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 02:37:20,451 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 02:37:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 02:37:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 02:37:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 02:37:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 02:37:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 02:37:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 02:37:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 02:37:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 02:37:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 02:37:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 02:37:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 02:37:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 02:37:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 02:37:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 02:37:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 02:37:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 02:37:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 02:37:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 02:37:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 02:37:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 02:37:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 02:37:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 02:37:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 02:37:20,457 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 02:37:20,457 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 02:37:20,457 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 02:37:20,457 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 02:37:20,457 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 02:37:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 02:37:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 02:37:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 02:37:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 02:37:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 02:37:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 02:37:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 02:37:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 02:37:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 02:37:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 02:37:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 02:37:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 02:37:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 02:37:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 02:37:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 02:37:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 02:37:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 02:37:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 02:37:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 02:37:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 02:37:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 02:37:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 02:37:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 02:37:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 02:37:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 02:37:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 02:37:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 02:37:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 02:37:20,464 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 02:37:20,464 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 02:37:20,464 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 02:37:20,464 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 02:37:20,464 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 02:37:20,465 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 02:37:20,465 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 02:37:20,465 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 02:37:20,465 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 02:37:20,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 02:37:20,466 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 02:37:20,466 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 02:37:20,466 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 02:37:20,466 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 02:37:20,466 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 02:37:20,466 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 02:37:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 02:37:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 02:37:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 02:37:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 02:37:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 02:37:20,468 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 02:37:20,468 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 02:37:20,468 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 02:37:20,468 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 02:37:20,469 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 02:37:20,469 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 02:37:20,469 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 02:37:20,469 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 02:37:20,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:37:20,470 INFO L130 BoogieDeclarations]: Found specification of procedure test_fun [2019-11-28 02:37:20,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 02:37:20,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:37:20,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:37:20,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:37:20,471 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:37:20,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:37:20,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:37:21,084 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:37:21,085 INFO L297 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 02:37:21,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:21 BoogieIcfgContainer [2019-11-28 02:37:21,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:37:21,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:37:21,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:37:21,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:37:21,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:37:19" (1/3) ... [2019-11-28 02:37:21,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52597f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:37:21, skipping insertion in model container [2019-11-28 02:37:21,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:20" (2/3) ... [2019-11-28 02:37:21,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52597f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:37:21, skipping insertion in model container [2019-11-28 02:37:21,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:21" (3/3) ... [2019-11-28 02:37:21,103 INFO L109 eAbstractionObserver]: Analyzing ICFG c.03-alloca-2.i [2019-11-28 02:37:21,114 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:37:21,123 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-11-28 02:37:21,136 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-11-28 02:37:21,154 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:37:21,154 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:37:21,154 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:37:21,155 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:37:21,155 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:37:21,155 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:37:21,155 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:37:21,156 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:37:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2019-11-28 02:37:21,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 02:37:21,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:21,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:21,178 INFO L410 AbstractCegarLoop]: === Iteration 1 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:37:21,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:21,183 INFO L82 PathProgramCache]: Analyzing trace with hash 743499951, now seen corresponding path program 1 times [2019-11-28 02:37:21,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:21,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074790307] [2019-11-28 02:37:21,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:21,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074790307] [2019-11-28 02:37:21,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:21,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:21,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755408159] [2019-11-28 02:37:21,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:21,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:21,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:21,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:21,471 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 4 states. [2019-11-28 02:37:21,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:21,656 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-11-28 02:37:21,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:21,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 02:37:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:21,667 INFO L225 Difference]: With dead ends: 62 [2019-11-28 02:37:21,667 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 02:37:21,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 02:37:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-28 02:37:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 02:37:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-11-28 02:37:21,704 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 9 [2019-11-28 02:37:21,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:21,705 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-11-28 02:37:21,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-11-28 02:37:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 02:37:21,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:21,706 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:21,707 INFO L410 AbstractCegarLoop]: === Iteration 2 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:37:21,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:21,708 INFO L82 PathProgramCache]: Analyzing trace with hash 743499952, now seen corresponding path program 1 times [2019-11-28 02:37:21,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:21,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922538492] [2019-11-28 02:37:21,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:21,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922538492] [2019-11-28 02:37:21,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:21,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:21,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774089932] [2019-11-28 02:37:21,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:21,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:21,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:21,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:21,807 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 4 states. [2019-11-28 02:37:21,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:21,932 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-28 02:37:21,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:21,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 02:37:21,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:21,934 INFO L225 Difference]: With dead ends: 54 [2019-11-28 02:37:21,934 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 02:37:21,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:21,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 02:37:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-28 02:37:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 02:37:21,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-11-28 02:37:21,942 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 9 [2019-11-28 02:37:21,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:21,942 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-11-28 02:37:21,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:21,943 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-11-28 02:37:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:37:21,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:21,943 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:21,944 INFO L410 AbstractCegarLoop]: === Iteration 3 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:37:21,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:21,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1573661992, now seen corresponding path program 1 times [2019-11-28 02:37:21,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:21,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825577847] [2019-11-28 02:37:21,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:22,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:22,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825577847] [2019-11-28 02:37:22,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:22,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:22,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285334329] [2019-11-28 02:37:22,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:22,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:22,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:22,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:22,056 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 4 states. [2019-11-28 02:37:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:22,178 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-11-28 02:37:22,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:22,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 02:37:22,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:22,180 INFO L225 Difference]: With dead ends: 52 [2019-11-28 02:37:22,181 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 02:37:22,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:22,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 02:37:22,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-28 02:37:22,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 02:37:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-11-28 02:37:22,188 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 10 [2019-11-28 02:37:22,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:22,189 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-11-28 02:37:22,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:22,189 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-11-28 02:37:22,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:37:22,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:22,190 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:22,190 INFO L410 AbstractCegarLoop]: === Iteration 4 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:37:22,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:22,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1573661993, now seen corresponding path program 1 times [2019-11-28 02:37:22,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:22,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426949766] [2019-11-28 02:37:22,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:22,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426949766] [2019-11-28 02:37:22,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:22,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:22,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65863210] [2019-11-28 02:37:22,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:22,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:22,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:22,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:22,287 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 4 states. [2019-11-28 02:37:22,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:22,395 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-11-28 02:37:22,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:22,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 02:37:22,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:22,397 INFO L225 Difference]: With dead ends: 50 [2019-11-28 02:37:22,397 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 02:37:22,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:22,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 02:37:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-28 02:37:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 02:37:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-28 02:37:22,409 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 10 [2019-11-28 02:37:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:22,409 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-28 02:37:22,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-28 02:37:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:37:22,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:22,411 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:22,411 INFO L410 AbstractCegarLoop]: === Iteration 5 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:37:22,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:22,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1538881490, now seen corresponding path program 1 times [2019-11-28 02:37:22,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:22,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52518711] [2019-11-28 02:37:22,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:22,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52518711] [2019-11-28 02:37:22,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:22,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:22,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185302451] [2019-11-28 02:37:22,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:22,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:22,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:22,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:22,513 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 4 states. [2019-11-28 02:37:22,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:22,624 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-11-28 02:37:22,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:22,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 02:37:22,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:22,626 INFO L225 Difference]: With dead ends: 46 [2019-11-28 02:37:22,626 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 02:37:22,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 02:37:22,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-11-28 02:37:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 02:37:22,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-11-28 02:37:22,632 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 11 [2019-11-28 02:37:22,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:22,632 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-11-28 02:37:22,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:22,633 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-11-28 02:37:22,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:37:22,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:22,633 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:22,634 INFO L410 AbstractCegarLoop]: === Iteration 6 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:37:22,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:22,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1538881491, now seen corresponding path program 1 times [2019-11-28 02:37:22,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:22,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124040977] [2019-11-28 02:37:22,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:22,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124040977] [2019-11-28 02:37:22,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:22,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:22,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996727301] [2019-11-28 02:37:22,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:22,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:22,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:22,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:22,706 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 4 states. [2019-11-28 02:37:22,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:22,792 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-11-28 02:37:22,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:22,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 02:37:22,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:22,794 INFO L225 Difference]: With dead ends: 42 [2019-11-28 02:37:22,794 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 02:37:22,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:22,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 02:37:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-28 02:37:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 02:37:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-11-28 02:37:22,800 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 11 [2019-11-28 02:37:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:22,800 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-11-28 02:37:22,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:22,801 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-11-28 02:37:22,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:37:22,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:22,802 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:22,802 INFO L410 AbstractCegarLoop]: === Iteration 7 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:37:22,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:22,803 INFO L82 PathProgramCache]: Analyzing trace with hash 460685931, now seen corresponding path program 1 times [2019-11-28 02:37:22,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:22,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707400833] [2019-11-28 02:37:22,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:22,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707400833] [2019-11-28 02:37:22,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:22,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:22,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301410767] [2019-11-28 02:37:22,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:22,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:22,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:22,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:22,888 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 4 states. [2019-11-28 02:37:22,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:22,969 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-11-28 02:37:22,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:22,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 02:37:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:22,977 INFO L225 Difference]: With dead ends: 38 [2019-11-28 02:37:22,977 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 02:37:22,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:22,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 02:37:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-28 02:37:22,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 02:37:22,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-28 02:37:22,981 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 12 [2019-11-28 02:37:22,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:22,984 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-28 02:37:22,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-28 02:37:22,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:37:22,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:22,985 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:22,990 INFO L410 AbstractCegarLoop]: === Iteration 8 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:37:22,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:22,990 INFO L82 PathProgramCache]: Analyzing trace with hash 460685932, now seen corresponding path program 1 times [2019-11-28 02:37:22,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:22,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157585422] [2019-11-28 02:37:22,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:23,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157585422] [2019-11-28 02:37:23,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:23,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:23,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101298899] [2019-11-28 02:37:23,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:23,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:23,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:23,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:23,052 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 4 states. [2019-11-28 02:37:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:23,126 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-11-28 02:37:23,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:23,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 02:37:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:23,127 INFO L225 Difference]: With dead ends: 34 [2019-11-28 02:37:23,127 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 02:37:23,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 02:37:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-28 02:37:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 02:37:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-11-28 02:37:23,131 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 12 [2019-11-28 02:37:23,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:23,132 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-11-28 02:37:23,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-11-28 02:37:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:37:23,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:23,133 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:23,133 INFO L410 AbstractCegarLoop]: === Iteration 9 === [test_funErr25REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr8REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:37:23,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:23,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1533919015, now seen corresponding path program 1 times [2019-11-28 02:37:23,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:23,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877994373] [2019-11-28 02:37:23,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:23,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877994373] [2019-11-28 02:37:23,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:23,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:37:23,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151299716] [2019-11-28 02:37:23,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:23,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:23,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:23,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:37:23,348 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 6 states. [2019-11-28 02:37:23,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:23,503 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-11-28 02:37:23,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:37:23,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-28 02:37:23,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:23,504 INFO L225 Difference]: With dead ends: 33 [2019-11-28 02:37:23,504 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:37:23,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:37:23,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:37:23,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:37:23,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:37:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:37:23,505 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-11-28 02:37:23,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:23,506 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:37:23,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:37:23,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:37:23,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:37:23 BoogieIcfgContainer [2019-11-28 02:37:23,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:37:23,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:37:23,512 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:37:23,512 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:37:23,512 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:21" (3/4) ... [2019-11-28 02:37:23,516 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:37:23,523 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:37:23,523 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-28 02:37:23,523 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure test_fun [2019-11-28 02:37:23,523 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-28 02:37:23,524 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-28 02:37:23,524 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-28 02:37:23,524 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:37:23,524 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-28 02:37:23,530 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-28 02:37:23,530 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-28 02:37:23,530 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:37:23,531 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:37:23,595 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:37:23,595 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:37:23,597 INFO L168 Benchmark]: Toolchain (without parser) took 3902.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 952.3 MB in the beginning and 839.7 MB in the end (delta: 112.6 MB). Peak memory consumption was 260.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:23,598 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:37:23,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 631.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:23,599 INFO L168 Benchmark]: Boogie Preprocessor took 56.29 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:23,600 INFO L168 Benchmark]: RCFGBuilder took 703.32 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: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:23,600 INFO L168 Benchmark]: TraceAbstraction took 2422.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 839.7 MB in the end (delta: 232.8 MB). Peak memory consumption was 232.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:23,601 INFO L168 Benchmark]: Witness Printer took 83.66 ms. Allocated memory is still 1.2 GB. Free memory is still 839.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:37:23,603 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 631.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.29 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 703.32 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: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2422.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 839.7 MB in the end (delta: 232.8 MB). Peak memory consumption was 232.8 MB. Max. memory is 11.5 GB. * Witness Printer took 83.66 ms. Allocated memory is still 1.2 GB. Free memory is still 839.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 82 locations, 31 error locations. Result: SAFE, OverallTime: 2.3s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 202 SDtfs, 301 SDslu, 95 SDs, 0 SdLazy, 660 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 10636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...