./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b87efc31cc381b9fe84243511097e1307d2087b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 08:01:56,377 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:01:56,378 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:01:56,387 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:01:56,387 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:01:56,388 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:01:56,388 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:01:56,390 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:01:56,391 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:01:56,391 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:01:56,392 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:01:56,392 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:01:56,393 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:01:56,393 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:01:56,394 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:01:56,395 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:01:56,395 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:01:56,397 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:01:56,398 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:01:56,399 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:01:56,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:01:56,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:01:56,402 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:01:56,402 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:01:56,403 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:01:56,403 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:01:56,404 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:01:56,405 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:01:56,405 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:01:56,406 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:01:56,406 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:01:56,407 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:01:56,407 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:01:56,407 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:01:56,407 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:01:56,408 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:01:56,408 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 08:01:56,418 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:01:56,418 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:01:56,419 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 08:01:56,419 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 08:01:56,419 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:01:56,420 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:01:56,420 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 08:01:56,420 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:01:56,420 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:01:56,420 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:01:56,420 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:01:56,420 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:01:56,421 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 08:01:56,421 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 08:01:56,421 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 08:01:56,421 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:01:56,421 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:01:56,421 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 08:01:56,421 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:01:56,422 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:01:56,422 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 08:01:56,422 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 08:01:56,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:01:56,422 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:01:56,422 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 08:01:56,422 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 08:01:56,423 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 08:01:56,423 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 08:01:56,423 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 08:01:56,423 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) 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 -> 8b87efc31cc381b9fe84243511097e1307d2087b [2018-11-10 08:01:56,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:01:56,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:01:56,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:01:56,454 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:01:56,454 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:01:56,454 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-11-10 08:01:56,497 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer/data/9d66de761/2b8e946af72c4f0bace27744eb4ce403/FLAGd6e98814c [2018-11-10 08:01:56,863 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:01:56,863 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-11-10 08:01:56,874 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer/data/9d66de761/2b8e946af72c4f0bace27744eb4ce403/FLAGd6e98814c [2018-11-10 08:01:56,883 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer/data/9d66de761/2b8e946af72c4f0bace27744eb4ce403 [2018-11-10 08:01:56,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:01:56,886 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 08:01:56,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:01:56,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:01:56,889 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:01:56,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:01:56" (1/1) ... [2018-11-10 08:01:56,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d9ec01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:01:56, skipping insertion in model container [2018-11-10 08:01:56,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:01:56" (1/1) ... [2018-11-10 08:01:56,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:01:56,922 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:01:57,099 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:01:57,106 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:01:57,138 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:01:57,168 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:01:57,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:01:57 WrapperNode [2018-11-10 08:01:57,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:01:57,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:01:57,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:01:57,169 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:01:57,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:01:57" (1/1) ... [2018-11-10 08:01:57,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:01:57" (1/1) ... [2018-11-10 08:01:57,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:01:57" (1/1) ... [2018-11-10 08:01:57,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:01:57" (1/1) ... [2018-11-10 08:01:57,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:01:57" (1/1) ... [2018-11-10 08:01:57,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:01:57" (1/1) ... [2018-11-10 08:01:57,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:01:57" (1/1) ... [2018-11-10 08:01:57,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:01:57,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:01:57,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:01:57,250 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:01:57,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:01:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:01:57,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 08:01:57,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:01:57,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-10 08:01:57,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-10 08:01:57,286 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-10 08:01:57,286 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-10 08:01:57,286 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 08:01:57,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 08:01:57,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 08:01:57,287 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-10 08:01:57,287 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-10 08:01:57,287 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-10 08:01:57,287 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-10 08:01:57,287 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-10 08:01:57,287 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-10 08:01:57,287 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-10 08:01:57,287 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-10 08:01:57,288 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-10 08:01:57,288 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-10 08:01:57,288 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-10 08:01:57,288 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-10 08:01:57,288 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-10 08:01:57,288 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-10 08:01:57,288 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-10 08:01:57,288 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-10 08:01:57,288 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-10 08:01:57,288 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-10 08:01:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-10 08:01:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-10 08:01:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-10 08:01:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-10 08:01:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-10 08:01:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-10 08:01:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-10 08:01:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-10 08:01:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-10 08:01:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-10 08:01:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-10 08:01:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-10 08:01:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-10 08:01:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-10 08:01:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-10 08:01:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-10 08:01:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-10 08:01:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-10 08:01:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-10 08:01:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-10 08:01:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-10 08:01:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-10 08:01:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-10 08:01:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-10 08:01:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-10 08:01:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-10 08:01:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-10 08:01:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-10 08:01:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-10 08:01:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-10 08:01:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-10 08:01:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-10 08:01:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-10 08:01:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-10 08:01:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 08:01:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-10 08:01:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-10 08:01:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-10 08:01:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-10 08:01:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-10 08:01:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-10 08:01:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-10 08:01:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-10 08:01:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-10 08:01:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-10 08:01:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-10 08:01:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-10 08:01:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 08:01:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-10 08:01:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-10 08:01:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-10 08:01:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-10 08:01:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-10 08:01:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-10 08:01:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-10 08:01:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-10 08:01:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-10 08:01:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-10 08:01:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-10 08:01:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-10 08:01:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-10 08:01:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-10 08:01:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-10 08:01:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-10 08:01:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-10 08:01:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-10 08:01:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-10 08:01:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-10 08:01:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-10 08:01:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-10 08:01:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-10 08:01:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 08:01:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 08:01:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 08:01:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 08:01:57,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 08:01:57,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 08:01:57,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 08:01:57,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 08:01:57,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:01:57,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 08:01:57,572 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:01:57,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:01:57 BoogieIcfgContainer [2018-11-10 08:01:57,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:01:57,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 08:01:57,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 08:01:57,575 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 08:01:57,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:01:56" (1/3) ... [2018-11-10 08:01:57,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bf6452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:01:57, skipping insertion in model container [2018-11-10 08:01:57,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:01:57" (2/3) ... [2018-11-10 08:01:57,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bf6452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:01:57, skipping insertion in model container [2018-11-10 08:01:57,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:01:57" (3/3) ... [2018-11-10 08:01:57,578 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-11-10 08:01:57,586 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 08:01:57,592 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 08:01:57,604 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 08:01:57,627 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 08:01:57,628 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 08:01:57,628 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 08:01:57,628 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 08:01:57,628 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:01:57,629 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:01:57,629 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 08:01:57,629 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:01:57,629 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 08:01:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-11-10 08:01:57,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 08:01:57,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:01:57,649 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:01:57,651 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:01:57,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:01:57,655 INFO L82 PathProgramCache]: Analyzing trace with hash -471217347, now seen corresponding path program 1 times [2018-11-10 08:01:57,656 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:01:57,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:01:57,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:01:57,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:01:57,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:01:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:01:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:01:57,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:01:57,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:01:57,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 08:01:57,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 08:01:57,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 08:01:57,760 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 2 states. [2018-11-10 08:01:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:01:57,776 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2018-11-10 08:01:57,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 08:01:57,777 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-10 08:01:57,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:01:57,785 INFO L225 Difference]: With dead ends: 111 [2018-11-10 08:01:57,785 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 08:01:57,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 08:01:57,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 08:01:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-10 08:01:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 08:01:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2018-11-10 08:01:57,813 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 23 [2018-11-10 08:01:57,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:01:57,813 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2018-11-10 08:01:57,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 08:01:57,813 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-10 08:01:57,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 08:01:57,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:01:57,814 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:01:57,814 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:01:57,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:01:57,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1253734870, now seen corresponding path program 1 times [2018-11-10 08:01:57,814 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:01:57,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:01:57,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:01:57,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:01:57,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:01:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:01:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:01:57,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:01:57,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 08:01:57,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 08:01:57,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:01:57,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:01:57,868 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 5 states. [2018-11-10 08:01:57,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:01:57,918 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2018-11-10 08:01:57,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:01:57,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-10 08:01:57,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:01:57,920 INFO L225 Difference]: With dead ends: 114 [2018-11-10 08:01:57,920 INFO L226 Difference]: Without dead ends: 77 [2018-11-10 08:01:57,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:01:57,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-10 08:01:57,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2018-11-10 08:01:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 08:01:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-11-10 08:01:57,927 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 24 [2018-11-10 08:01:57,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:01:57,927 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-11-10 08:01:57,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 08:01:57,927 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-11-10 08:01:57,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 08:01:57,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:01:57,928 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:01:57,929 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:01:57,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:01:57,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1082042518, now seen corresponding path program 1 times [2018-11-10 08:01:57,929 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:01:57,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:01:57,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:01:57,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:01:57,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:01:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:01:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:01:58,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:01:58,009 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:01:58,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:01:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:01:58,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:01:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:01:58,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:01:58,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 08:01:58,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:01:58,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:01:58,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:01:58,089 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 6 states. [2018-11-10 08:01:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:01:58,148 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2018-11-10 08:01:58,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:01:58,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-10 08:01:58,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:01:58,150 INFO L225 Difference]: With dead ends: 130 [2018-11-10 08:01:58,150 INFO L226 Difference]: Without dead ends: 93 [2018-11-10 08:01:58,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:01:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-10 08:01:58,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2018-11-10 08:01:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 08:01:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2018-11-10 08:01:58,156 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 39 [2018-11-10 08:01:58,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:01:58,157 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2018-11-10 08:01:58,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:01:58,157 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2018-11-10 08:01:58,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 08:01:58,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:01:58,158 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:01:58,158 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:01:58,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:01:58,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1160175786, now seen corresponding path program 2 times [2018-11-10 08:01:58,159 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:01:58,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:01:58,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:01:58,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:01:58,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:01:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:01:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:01:58,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:01:58,223 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:01:58,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 08:01:58,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 08:01:58,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:01:58,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:01:58,347 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:01:58,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:01:58,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-11-10 08:01:58,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 08:01:58,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 08:01:58,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-10 08:01:58,375 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 10 states. [2018-11-10 08:01:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:01:58,606 INFO L93 Difference]: Finished difference Result 165 states and 190 transitions. [2018-11-10 08:01:58,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 08:01:58,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-10 08:01:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:01:58,608 INFO L225 Difference]: With dead ends: 165 [2018-11-10 08:01:58,608 INFO L226 Difference]: Without dead ends: 109 [2018-11-10 08:01:58,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-11-10 08:01:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-10 08:01:58,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2018-11-10 08:01:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-10 08:01:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2018-11-10 08:01:58,616 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 54 [2018-11-10 08:01:58,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:01:58,617 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2018-11-10 08:01:58,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 08:01:58,618 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2018-11-10 08:01:58,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 08:01:58,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:01:58,620 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:01:58,620 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:01:58,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:01:58,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1764250198, now seen corresponding path program 1 times [2018-11-10 08:01:58,620 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:01:58,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:01:58,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:01:58,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:01:58,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:01:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:01:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:01:58,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:01:58,736 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:01:58,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:01:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:01:58,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:01:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:01:58,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:01:58,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 08:01:58,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 08:01:58,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 08:01:58,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 08:01:58,810 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand 8 states. [2018-11-10 08:01:58,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:01:58,848 INFO L93 Difference]: Finished difference Result 162 states and 182 transitions. [2018-11-10 08:01:58,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:01:58,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-11-10 08:01:58,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:01:58,850 INFO L225 Difference]: With dead ends: 162 [2018-11-10 08:01:58,850 INFO L226 Difference]: Without dead ends: 125 [2018-11-10 08:01:58,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:01:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-10 08:01:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2018-11-10 08:01:58,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-10 08:01:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2018-11-10 08:01:58,858 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 71 [2018-11-10 08:01:58,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:01:58,858 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2018-11-10 08:01:58,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 08:01:58,859 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2018-11-10 08:01:58,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 08:01:58,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:01:58,860 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:01:58,861 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:01:58,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:01:58,862 INFO L82 PathProgramCache]: Analyzing trace with hash 12406220, now seen corresponding path program 2 times [2018-11-10 08:01:58,862 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:01:58,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:01:58,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:01:58,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:01:58,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:01:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:01:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:01:58,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:01:58,985 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:01:58,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 08:01:59,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 08:01:59,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:01:59,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:01:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:01:59,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:01:59,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-10 08:01:59,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 08:01:59,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 08:01:59,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:01:59,082 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 9 states. [2018-11-10 08:01:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:01:59,145 INFO L93 Difference]: Finished difference Result 178 states and 199 transitions. [2018-11-10 08:01:59,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 08:01:59,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-11-10 08:01:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:01:59,146 INFO L225 Difference]: With dead ends: 178 [2018-11-10 08:01:59,146 INFO L226 Difference]: Without dead ends: 141 [2018-11-10 08:01:59,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-10 08:01:59,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-10 08:01:59,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 127. [2018-11-10 08:01:59,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-10 08:01:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2018-11-10 08:01:59,152 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 87 [2018-11-10 08:01:59,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:01:59,153 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2018-11-10 08:01:59,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 08:01:59,153 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2018-11-10 08:01:59,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 08:01:59,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:01:59,154 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:01:59,154 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:01:59,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:01:59,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1421304510, now seen corresponding path program 3 times [2018-11-10 08:01:59,155 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:01:59,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:01:59,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:01:59,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:01:59,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:01:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:01:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-10 08:01:59,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:01:59,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 08:01:59,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 08:01:59,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 08:01:59,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:01:59,354 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand 9 states. [2018-11-10 08:01:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:01:59,531 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2018-11-10 08:01:59,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 08:01:59,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2018-11-10 08:01:59,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:01:59,533 INFO L225 Difference]: With dead ends: 193 [2018-11-10 08:01:59,533 INFO L226 Difference]: Without dead ends: 160 [2018-11-10 08:01:59,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-10 08:01:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-10 08:01:59,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2018-11-10 08:01:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-10 08:01:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2018-11-10 08:01:59,548 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 103 [2018-11-10 08:01:59,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:01:59,549 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2018-11-10 08:01:59,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 08:01:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2018-11-10 08:01:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 08:01:59,550 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:01:59,550 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:01:59,551 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:01:59,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:01:59,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1610087269, now seen corresponding path program 1 times [2018-11-10 08:01:59,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:01:59,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:01:59,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:01:59,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:01:59,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:01:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:01:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 57 proven. 36 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-10 08:01:59,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:01:59,792 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:01:59,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:01:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:01:59,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:01:59,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 08:01:59,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 08:01:59,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 08:01:59,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 08:01:59,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 08:01:59,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 08:01:59,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 08:01:59,885 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 08:01:59,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 08:01:59,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 08:01:59,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 08:01:59,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 08:01:59,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2018-11-10 08:01:59,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 08:01:59,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 08:01:59,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 08:01:59,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 08:01:59,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 08:01:59,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 08:01:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-10 08:01:59,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:01:59,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 17 [2018-11-10 08:01:59,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 08:01:59,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 08:01:59,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-10 08:01:59,969 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand 17 states. [2018-11-10 08:02:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:02:00,226 INFO L93 Difference]: Finished difference Result 193 states and 217 transitions. [2018-11-10 08:02:00,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 08:02:00,226 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 105 [2018-11-10 08:02:00,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:02:00,227 INFO L225 Difference]: With dead ends: 193 [2018-11-10 08:02:00,227 INFO L226 Difference]: Without dead ends: 160 [2018-11-10 08:02:00,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2018-11-10 08:02:00,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-10 08:02:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 137. [2018-11-10 08:02:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-10 08:02:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2018-11-10 08:02:00,234 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 105 [2018-11-10 08:02:00,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:02:00,235 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2018-11-10 08:02:00,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 08:02:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2018-11-10 08:02:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 08:02:00,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:02:00,237 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:02:00,238 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:02:00,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:02:00,238 INFO L82 PathProgramCache]: Analyzing trace with hash -324277635, now seen corresponding path program 1 times [2018-11-10 08:02:00,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:02:00,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:02:00,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:02:00,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:02:00,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:02:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:02:00,335 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-10 08:02:00,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:02:00,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 08:02:00,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 08:02:00,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 08:02:00,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:02:00,336 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand 9 states. [2018-11-10 08:02:00,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:02:00,451 INFO L93 Difference]: Finished difference Result 178 states and 197 transitions. [2018-11-10 08:02:00,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 08:02:00,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 107 [2018-11-10 08:02:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:02:00,452 INFO L225 Difference]: With dead ends: 178 [2018-11-10 08:02:00,452 INFO L226 Difference]: Without dead ends: 160 [2018-11-10 08:02:00,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-10 08:02:00,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-10 08:02:00,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 144. [2018-11-10 08:02:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-10 08:02:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2018-11-10 08:02:00,458 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 107 [2018-11-10 08:02:00,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:02:00,459 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2018-11-10 08:02:00,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 08:02:00,459 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2018-11-10 08:02:00,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 08:02:00,460 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:02:00,460 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:02:00,460 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:02:00,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:02:00,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1107287528, now seen corresponding path program 1 times [2018-11-10 08:02:00,461 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:02:00,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:02:00,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:02:00,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:02:00,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:02:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:02:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:02:00,532 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 08:02:00,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:02:00 BoogieIcfgContainer [2018-11-10 08:02:00,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 08:02:00,578 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:02:00,578 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:02:00,578 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:02:00,578 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:01:57" (3/4) ... [2018-11-10 08:02:00,580 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 08:02:00,630 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6bb71382-cb44-494e-88f9-cf1fee91f589/bin-2019/uautomizer/witness.graphml [2018-11-10 08:02:00,631 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:02:00,631 INFO L168 Benchmark]: Toolchain (without parser) took 3745.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.0 MB). Free memory was 956.4 MB in the beginning and 902.7 MB in the end (delta: 53.8 MB). Peak memory consumption was 279.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:02:00,632 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:02:00,632 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.75 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 929.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 08:02:00,633 INFO L168 Benchmark]: Boogie Preprocessor took 81.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -218.1 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-11-10 08:02:00,633 INFO L168 Benchmark]: RCFGBuilder took 322.20 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2018-11-10 08:02:00,633 INFO L168 Benchmark]: TraceAbstraction took 3004.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 907.7 MB in the end (delta: 190.8 MB). Peak memory consumption was 263.1 MB. Max. memory is 11.5 GB. [2018-11-10 08:02:00,633 INFO L168 Benchmark]: Witness Printer took 53.05 ms. Allocated memory is still 1.3 GB. Free memory was 907.7 MB in the beginning and 902.7 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2018-11-10 08:02:00,635 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 281.75 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 929.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -218.1 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 322.20 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3004.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 907.7 MB in the end (delta: 190.8 MB). Peak memory consumption was 263.1 MB. Max. memory is 11.5 GB. * Witness Printer took 53.05 ms. Allocated memory is still 1.3 GB. Free memory was 907.7 MB in the beginning and 902.7 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 605]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L588] const int len = 5; VAL [len=5] [L589] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L568] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L569] COND TRUE len > 0 VAL [\old(len)=5, head={0:0}, len=5] [L570] EXPR, FCALL malloc(sizeof(struct node)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={25:0}] [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={25:0}, new_head={25:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={25:0}, new_head={25:0}] [L574] FCALL new_head->data_0 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={25:0}, new_head={25:0}] [L575] FCALL new_head->data_1 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={25:0}, new_head={25:0}] [L576] COND TRUE, EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={25:0}, new_head={25:0}] [L576] FCALL new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={25:0}, new_head={25:0}] [L577] FCALL new_head->next = head VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={25:0}, new_head={25:0}] [L578] FCALL new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={25:0}, new_head={25:0}] [L579] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={25:0}, new_head={25:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={25:0}, len=4, malloc(sizeof(struct node))={25:0}, new_head={25:0}] [L569] COND TRUE len > 0 VAL [\old(len)=5, head={25:0}, len=4, malloc(sizeof(struct node))={25:0}, new_head={25:0}] [L570] EXPR, FCALL malloc(sizeof(struct node)) VAL [\old(len)=5, head={25:0}, len=4, malloc(sizeof(struct node))={23:0}, new_head={25:0}] [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={25:0}, len=4, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={25:0}, len=4, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L574] FCALL new_head->data_0 = 0 VAL [\old(len)=5, head={25:0}, len=4, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L575] FCALL new_head->data_1 = 0 VAL [\old(len)=5, head={25:0}, len=4, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L576] COND TRUE, EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={25:0}, len=4, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L576] FCALL new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={25:0}, len=4, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L577] FCALL new_head->next = head VAL [\old(len)=5, head={25:0}, len=4, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L578] FCALL new_head->prev = ((void *)0) VAL [\old(len)=5, head={25:0}, len=4, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={25:0}, len=4, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L580] FCALL head->prev = new_head VAL [\old(len)=5, head={25:0}, len=4, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={23:0}, len=3, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L569] COND TRUE len > 0 VAL [\old(len)=5, head={23:0}, len=3, malloc(sizeof(struct node))={23:0}, new_head={23:0}] [L570] EXPR, FCALL malloc(sizeof(struct node)) VAL [\old(len)=5, head={23:0}, len=3, malloc(sizeof(struct node))={27:0}, new_head={23:0}] [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={23:0}, len=3, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={23:0}, len=3, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L574] FCALL new_head->data_0 = 0 VAL [\old(len)=5, head={23:0}, len=3, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L575] FCALL new_head->data_1 = 0 VAL [\old(len)=5, head={23:0}, len=3, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L576] COND TRUE, EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={23:0}, len=3, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L576] FCALL new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={23:0}, len=3, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L577] FCALL new_head->next = head VAL [\old(len)=5, head={23:0}, len=3, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L578] FCALL new_head->prev = ((void *)0) VAL [\old(len)=5, head={23:0}, len=3, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={23:0}, len=3, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L580] FCALL head->prev = new_head VAL [\old(len)=5, head={23:0}, len=3, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={27:0}, len=2, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L569] COND TRUE len > 0 VAL [\old(len)=5, head={27:0}, len=2, malloc(sizeof(struct node))={27:0}, new_head={27:0}] [L570] EXPR, FCALL malloc(sizeof(struct node)) VAL [\old(len)=5, head={27:0}, len=2, malloc(sizeof(struct node))={21:0}, new_head={27:0}] [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={27:0}, len=2, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={27:0}, len=2, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L574] FCALL new_head->data_0 = 0 VAL [\old(len)=5, head={27:0}, len=2, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L575] FCALL new_head->data_1 = 0 VAL [\old(len)=5, head={27:0}, len=2, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L576] COND TRUE, EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={27:0}, len=2, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L576] FCALL new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={27:0}, len=2, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L577] FCALL new_head->next = head VAL [\old(len)=5, head={27:0}, len=2, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L578] FCALL new_head->prev = ((void *)0) VAL [\old(len)=5, head={27:0}, len=2, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={27:0}, len=2, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L580] FCALL head->prev = new_head VAL [\old(len)=5, head={27:0}, len=2, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={21:0}, len=1, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L569] COND TRUE len > 0 VAL [\old(len)=5, head={21:0}, len=1, malloc(sizeof(struct node))={21:0}, new_head={21:0}] [L570] EXPR, FCALL malloc(sizeof(struct node)) VAL [\old(len)=5, head={21:0}, len=1, malloc(sizeof(struct node))={26:0}, new_head={21:0}] [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={21:0}, len=1, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={21:0}, len=1, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L574] FCALL new_head->data_0 = 0 VAL [\old(len)=5, head={21:0}, len=1, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L575] FCALL new_head->data_1 = 0 VAL [\old(len)=5, head={21:0}, len=1, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L576] COND TRUE, EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={21:0}, len=1, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L576] FCALL new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={21:0}, len=1, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L577] FCALL new_head->next = head VAL [\old(len)=5, head={21:0}, len=1, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L578] FCALL new_head->prev = ((void *)0) VAL [\old(len)=5, head={21:0}, len=1, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L579] COND TRUE \read(head) VAL [\old(len)=5, head={21:0}, len=1, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L580] FCALL head->prev = new_head VAL [\old(len)=5, head={21:0}, len=1, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={26:0}, len=0, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L569] COND FALSE !(len > 0) VAL [\old(len)=5, head={26:0}, len=0, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L585] RET return head; VAL [\old(len)=5, \result={26:0}, head={26:0}, len=0, malloc(sizeof(struct node))={26:0}, new_head={26:0}] [L589] EXPR dll_create(len) VAL [dll_create(len)={26:0}, len=5] [L589] DLL head = dll_create(len); [L590] FCALL head->next VAL [head={26:0}, head->next={21:0}, len=5] [L590] COND TRUE head->next [L591] EXPR, FCALL head->data_0 VAL [head={26:0}, head->data_0=0, len=5] [L591] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={26:0}, head->data_0=0, len=5] [L591] EXPR, FCALL head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={26:0}, head->data_0=0, head->data_1=0, len=5] [L591] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={26:0}, head->data_0=0, head->data_1=0, len=5] [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={26:0}, head->data_0=0, head->data_1=0, len=5] [L591] EXPR, FCALL head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={26:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={26:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L591] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L605] __VERIFIER_error() VAL [head={26:0}, len=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 77 locations, 1 error locations. UNSAFE Result, 2.9s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 564 SDtfs, 819 SDslu, 2543 SDs, 0 SdLazy, 989 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 372 SyntacticMatches, 5 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 136 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1076 NumberOfCodeBlocks, 1076 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 955 ConstructedInterpolants, 0 QuantifiedInterpolants, 234251 SizeOfPredicates, 18 NumberOfNonLiveVariables, 964 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 636/1012 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...