./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b2d654b7b73105d319f19561f723c76c3f2a6a70 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 11:03:08,628 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:03:08,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:03:08,635 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:03:08,635 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:03:08,636 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:03:08,636 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:03:08,637 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:03:08,638 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:03:08,638 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:03:08,638 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:03:08,639 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:03:08,639 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:03:08,639 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:03:08,640 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:03:08,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:03:08,641 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:03:08,641 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:03:08,642 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:03:08,643 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:03:08,644 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:03:08,644 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:03:08,645 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:03:08,645 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:03:08,645 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:03:08,646 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:03:08,646 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:03:08,647 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:03:08,647 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:03:08,647 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:03:08,648 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:03:08,648 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:03:08,648 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:03:08,648 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:03:08,649 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:03:08,649 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:03:08,649 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-09 11:03:08,656 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:03:08,656 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:03:08,656 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 11:03:08,656 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 11:03:08,657 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 11:03:08,657 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 11:03:08,657 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 11:03:08,657 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:03:08,657 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:03:08,657 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 11:03:08,657 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:03:08,657 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:03:08,657 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:03:08,658 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 11:03:08,658 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 11:03:08,658 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 11:03:08,658 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 11:03:08,658 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:03:08,658 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 11:03:08,658 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:03:08,658 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:03:08,658 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 11:03:08,658 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 11:03:08,658 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:03:08,659 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:03:08,659 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 11:03:08,659 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 11:03:08,659 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 11:03:08,659 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b2d654b7b73105d319f19561f723c76c3f2a6a70 [2018-12-09 11:03:08,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:03:08,681 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:03:08,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:03:08,684 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:03:08,684 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:03:08,685 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 11:03:08,723 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/bin-2019/uautomizer/data/8f3beac24/0b9e37daeb144f3dae051177eb02416c/FLAG9281a0d19 [2018-12-09 11:03:09,042 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:03:09,042 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 11:03:09,048 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/bin-2019/uautomizer/data/8f3beac24/0b9e37daeb144f3dae051177eb02416c/FLAG9281a0d19 [2018-12-09 11:03:09,451 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/bin-2019/uautomizer/data/8f3beac24/0b9e37daeb144f3dae051177eb02416c [2018-12-09 11:03:09,453 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:03:09,454 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 11:03:09,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:03:09,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:03:09,457 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:03:09,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:03:09" (1/1) ... [2018-12-09 11:03:09,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a3de0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:03:09, skipping insertion in model container [2018-12-09 11:03:09,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:03:09" (1/1) ... [2018-12-09 11:03:09,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:03:09,487 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:03:09,630 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:03:09,636 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:03:09,690 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:03:09,719 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:03:09,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:03:09 WrapperNode [2018-12-09 11:03:09,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:03:09,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:03:09,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:03:09,720 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:03:09,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:03:09" (1/1) ... [2018-12-09 11:03:09,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:03:09" (1/1) ... [2018-12-09 11:03:09,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:03:09" (1/1) ... [2018-12-09 11:03:09,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:03:09" (1/1) ... [2018-12-09 11:03:09,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:03:09" (1/1) ... [2018-12-09 11:03:09,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:03:09" (1/1) ... [2018-12-09 11:03:09,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:03:09" (1/1) ... [2018-12-09 11:03:09,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:03:09,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:03:09,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:03:09,752 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:03:09,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:03:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:03:09,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 11:03:09,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:03:09,783 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-09 11:03:09,783 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-09 11:03:09,783 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-12-09 11:03:09,783 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 11:03:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-09 11:03:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-09 11:03:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 11:03:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 11:03:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 11:03:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 11:03:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 11:03:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 11:03:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 11:03:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 11:03:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 11:03:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 11:03:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 11:03:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 11:03:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 11:03:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 11:03:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 11:03:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 11:03:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 11:03:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 11:03:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 11:03:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 11:03:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 11:03:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 11:03:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 11:03:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 11:03:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 11:03:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 11:03:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 11:03:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 11:03:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 11:03:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 11:03:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 11:03:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 11:03:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 11:03:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 11:03:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 11:03:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 11:03:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 11:03:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 11:03:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 11:03:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 11:03:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 11:03:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 11:03:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 11:03:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 11:03:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 11:03:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 11:03:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 11:03:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 11:03:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 11:03:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 11:03:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 11:03:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 11:03:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 11:03:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 11:03:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 11:03:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 11:03:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 11:03:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 11:03:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 11:03:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 11:03:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 11:03:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 11:03:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 11:03:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 11:03:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 11:03:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 11:03:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 11:03:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 11:03:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 11:03:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 11:03:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 11:03:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 11:03:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 11:03:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 11:03:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 11:03:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 11:03:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 11:03:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 11:03:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 11:03:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 11:03:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 11:03:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 11:03:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 11:03:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 11:03:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 11:03:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 11:03:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 11:03:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 11:03:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 11:03:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 11:03:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 11:03:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 11:03:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 11:03:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 11:03:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 11:03:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 11:03:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 11:03:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 11:03:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 11:03:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 11:03:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-09 11:03:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-12-09 11:03:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 11:03:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 11:03:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 11:03:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 11:03:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 11:03:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 11:03:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:03:10,019 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:03:10,019 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 11:03:10,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:03:10 BoogieIcfgContainer [2018-12-09 11:03:10,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:03:10,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 11:03:10,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 11:03:10,022 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 11:03:10,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 11:03:09" (1/3) ... [2018-12-09 11:03:10,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6132bd03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:03:10, skipping insertion in model container [2018-12-09 11:03:10,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:03:09" (2/3) ... [2018-12-09 11:03:10,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6132bd03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:03:10, skipping insertion in model container [2018-12-09 11:03:10,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:03:10" (3/3) ... [2018-12-09 11:03:10,023 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 11:03:10,029 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 11:03:10,034 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-09 11:03:10,042 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-09 11:03:10,057 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 11:03:10,057 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 11:03:10,057 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 11:03:10,057 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 11:03:10,057 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:03:10,057 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:03:10,057 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 11:03:10,057 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:03:10,057 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 11:03:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-12-09 11:03:10,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 11:03:10,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:10,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:10,073 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:10,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:10,076 INFO L82 PathProgramCache]: Analyzing trace with hash 364110360, now seen corresponding path program 1 times [2018-12-09 11:03:10,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:10,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:10,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:10,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:10,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:03:10,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 11:03:10,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:03:10,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:03:10,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:03:10,184 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-12-09 11:03:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:10,228 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-12-09 11:03:10,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:03:10,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 11:03:10,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:10,234 INFO L225 Difference]: With dead ends: 49 [2018-12-09 11:03:10,234 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 11:03:10,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:03:10,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 11:03:10,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-09 11:03:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 11:03:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-12-09 11:03:10,257 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 10 [2018-12-09 11:03:10,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:10,257 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-12-09 11:03:10,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:03:10,257 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-12-09 11:03:10,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 11:03:10,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:10,257 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:10,257 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:10,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:10,258 INFO L82 PathProgramCache]: Analyzing trace with hash 364110361, now seen corresponding path program 1 times [2018-12-09 11:03:10,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:10,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:10,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:10,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:10,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:10,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:03:10,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:03:10,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:03:10,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:03:10,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:03:10,300 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 4 states. [2018-12-09 11:03:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:10,313 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-12-09 11:03:10,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:03:10,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 11:03:10,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:10,314 INFO L225 Difference]: With dead ends: 45 [2018-12-09 11:03:10,314 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 11:03:10,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:03:10,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 11:03:10,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 11:03:10,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 11:03:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-09 11:03:10,317 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2018-12-09 11:03:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:10,317 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-09 11:03:10,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:03:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-09 11:03:10,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 11:03:10,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:10,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:10,318 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:10,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:10,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1597480737, now seen corresponding path program 1 times [2018-12-09 11:03:10,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:10,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:10,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:10,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:10,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:03:10,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 11:03:10,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:03:10,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:03:10,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:03:10,337 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 3 states. [2018-12-09 11:03:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:10,360 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-09 11:03:10,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:03:10,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 11:03:10,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:10,361 INFO L225 Difference]: With dead ends: 44 [2018-12-09 11:03:10,361 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 11:03:10,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:03:10,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 11:03:10,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 11:03:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 11:03:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-09 11:03:10,365 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 11 [2018-12-09 11:03:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:10,366 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-09 11:03:10,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:03:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-09 11:03:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 11:03:10,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:10,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:10,367 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:10,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:10,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1597480736, now seen corresponding path program 1 times [2018-12-09 11:03:10,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:10,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:10,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:10,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:10,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:03:10,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:03:10,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:03:10,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:03:10,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:03:10,409 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 4 states. [2018-12-09 11:03:10,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:10,417 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-12-09 11:03:10,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:03:10,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 11:03:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:10,418 INFO L225 Difference]: With dead ends: 43 [2018-12-09 11:03:10,418 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 11:03:10,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:03:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 11:03:10,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 11:03:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 11:03:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-09 11:03:10,420 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2018-12-09 11:03:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:10,421 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-09 11:03:10,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:03:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-09 11:03:10,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 11:03:10,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:10,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:10,421 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:10,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:10,421 INFO L82 PathProgramCache]: Analyzing trace with hash -373360435, now seen corresponding path program 1 times [2018-12-09 11:03:10,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:10,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:10,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:10,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:10,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:03:10,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:03:10,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:03:10,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:03:10,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:03:10,449 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 5 states. [2018-12-09 11:03:10,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:10,494 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-12-09 11:03:10,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:03:10,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-09 11:03:10,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:10,495 INFO L225 Difference]: With dead ends: 41 [2018-12-09 11:03:10,495 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 11:03:10,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:03:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 11:03:10,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 11:03:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 11:03:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-12-09 11:03:10,499 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 16 [2018-12-09 11:03:10,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:10,499 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-09 11:03:10,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:03:10,499 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-12-09 11:03:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 11:03:10,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:10,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:10,500 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:10,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:10,500 INFO L82 PathProgramCache]: Analyzing trace with hash -373360434, now seen corresponding path program 1 times [2018-12-09 11:03:10,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:10,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:10,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:10,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:10,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:03:10,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:03:10,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:03:10,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:03:10,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:03:10,569 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 7 states. [2018-12-09 11:03:10,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:10,627 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-12-09 11:03:10,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:03:10,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-09 11:03:10,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:10,629 INFO L225 Difference]: With dead ends: 55 [2018-12-09 11:03:10,629 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 11:03:10,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:03:10,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 11:03:10,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2018-12-09 11:03:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 11:03:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-09 11:03:10,633 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 16 [2018-12-09 11:03:10,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:10,633 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-09 11:03:10,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:03:10,633 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-09 11:03:10,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 11:03:10,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:10,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:10,634 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:10,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:10,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1977875214, now seen corresponding path program 1 times [2018-12-09 11:03:10,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:10,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:10,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:10,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:10,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:03:10,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:03:10,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:03:10,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:03:10,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:03:10,665 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 6 states. [2018-12-09 11:03:10,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:10,713 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-12-09 11:03:10,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:03:10,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-09 11:03:10,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:10,714 INFO L225 Difference]: With dead ends: 45 [2018-12-09 11:03:10,714 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 11:03:10,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:03:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 11:03:10,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 11:03:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 11:03:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-12-09 11:03:10,717 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 18 [2018-12-09 11:03:10,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:10,717 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-12-09 11:03:10,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:03:10,717 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-12-09 11:03:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 11:03:10,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:10,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:10,718 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:10,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:10,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1977875215, now seen corresponding path program 1 times [2018-12-09 11:03:10,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:10,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:10,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:10,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:10,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:03:10,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:03:10,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 11:03:10,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 11:03:10,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:03:10,802 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 8 states. [2018-12-09 11:03:10,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:10,873 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-12-09 11:03:10,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:03:10,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-09 11:03:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:10,874 INFO L225 Difference]: With dead ends: 47 [2018-12-09 11:03:10,874 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 11:03:10,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:03:10,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 11:03:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-12-09 11:03:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 11:03:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-12-09 11:03:10,876 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2018-12-09 11:03:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:10,877 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-12-09 11:03:10,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 11:03:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-12-09 11:03:10,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 11:03:10,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:10,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:10,878 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:10,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:10,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1184835937, now seen corresponding path program 1 times [2018-12-09 11:03:10,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:10,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:10,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:10,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:10,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:03:10,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:03:10,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:03:10,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:03:10,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:03:10,905 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 4 states. [2018-12-09 11:03:10,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:10,945 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-12-09 11:03:10,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:03:10,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-09 11:03:10,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:10,946 INFO L225 Difference]: With dead ends: 44 [2018-12-09 11:03:10,946 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 11:03:10,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:03:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 11:03:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-09 11:03:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 11:03:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-12-09 11:03:10,948 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 19 [2018-12-09 11:03:10,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:10,948 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-12-09 11:03:10,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:03:10,948 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-12-09 11:03:10,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 11:03:10,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:10,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:10,948 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:10,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:10,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1932430609, now seen corresponding path program 1 times [2018-12-09 11:03:10,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:10,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:10,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:10,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:10,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:03:10,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:03:10,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:03:10,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:03:10,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:03:10,978 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-12-09 11:03:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:11,019 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-09 11:03:11,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:03:11,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 11:03:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:11,020 INFO L225 Difference]: With dead ends: 37 [2018-12-09 11:03:11,020 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 11:03:11,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:03:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 11:03:11,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-09 11:03:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 11:03:11,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-12-09 11:03:11,022 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 20 [2018-12-09 11:03:11,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:11,022 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-12-09 11:03:11,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:03:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-12-09 11:03:11,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 11:03:11,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:11,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:11,023 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:11,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:11,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1932430608, now seen corresponding path program 1 times [2018-12-09 11:03:11,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:11,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:11,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:11,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:11,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:11,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:03:11,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:03:11,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:03:11,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:03:11,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:03:11,062 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 7 states. [2018-12-09 11:03:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:11,102 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-09 11:03:11,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:03:11,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-09 11:03:11,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:11,102 INFO L225 Difference]: With dead ends: 42 [2018-12-09 11:03:11,102 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 11:03:11,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:03:11,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 11:03:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-12-09 11:03:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 11:03:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-12-09 11:03:11,104 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 20 [2018-12-09 11:03:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:11,104 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-12-09 11:03:11,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:03:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-12-09 11:03:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 11:03:11,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:11,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:11,105 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:11,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:11,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1640219440, now seen corresponding path program 1 times [2018-12-09 11:03:11,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:11,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:11,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:11,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:11,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:11,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:03:11,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:03:11,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:03:11,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:03:11,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:03:11,130 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-12-09 11:03:11,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:11,157 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-09 11:03:11,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:03:11,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-09 11:03:11,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:11,158 INFO L225 Difference]: With dead ends: 37 [2018-12-09 11:03:11,158 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 11:03:11,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:03:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 11:03:11,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-09 11:03:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 11:03:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-12-09 11:03:11,159 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 22 [2018-12-09 11:03:11,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:11,159 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-12-09 11:03:11,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:03:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-12-09 11:03:11,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 11:03:11,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:11,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:11,160 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:11,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:11,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1640219439, now seen corresponding path program 1 times [2018-12-09 11:03:11,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:11,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:11,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:11,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:11,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:11,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:03:11,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 11:03:11,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 11:03:11,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 11:03:11,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:03:11,226 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 10 states. [2018-12-09 11:03:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:11,317 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-12-09 11:03:11,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:03:11,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-09 11:03:11,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:11,317 INFO L225 Difference]: With dead ends: 45 [2018-12-09 11:03:11,317 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 11:03:11,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-12-09 11:03:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 11:03:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-12-09 11:03:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 11:03:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-12-09 11:03:11,319 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 22 [2018-12-09 11:03:11,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:11,320 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-12-09 11:03:11,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 11:03:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-12-09 11:03:11,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 11:03:11,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:11,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:11,320 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:11,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:11,321 INFO L82 PathProgramCache]: Analyzing trace with hash 268491889, now seen corresponding path program 1 times [2018-12-09 11:03:11,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:11,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:11,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:11,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:11,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:11,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:11,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:03:11,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 11:03:11,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 11:03:11,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 11:03:11,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:03:11,443 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2018-12-09 11:03:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:11,528 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-12-09 11:03:11,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:03:11,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-12-09 11:03:11,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:11,528 INFO L225 Difference]: With dead ends: 50 [2018-12-09 11:03:11,528 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 11:03:11,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-09 11:03:11,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 11:03:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-09 11:03:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 11:03:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-09 11:03:11,530 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 24 [2018-12-09 11:03:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:11,530 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-09 11:03:11,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 11:03:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-09 11:03:11,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 11:03:11,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:11,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:11,531 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:11,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:11,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1725652817, now seen corresponding path program 1 times [2018-12-09 11:03:11,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:11,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:11,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:11,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:11,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:11,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:03:11,690 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/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-12-09 11:03:11,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:11,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:03:11,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 11:03:11,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 11:03:11,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:03:11,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:03:11,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:03:11,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 11:03:11,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-12-09 11:03:11,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-09 11:03:11,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:03:11,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 11:03:11,897 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 11:03:11,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-09 11:03:11,904 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:03:11,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:03:11,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:03:11,908 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-12-09 11:03:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:11,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 11:03:11,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 19 [2018-12-09 11:03:11,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 11:03:11,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 11:03:11,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-12-09 11:03:11,945 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2018-12-09 11:03:12,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:12,404 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-09 11:03:12,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 11:03:12,404 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-09 11:03:12,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:12,404 INFO L225 Difference]: With dead ends: 61 [2018-12-09 11:03:12,405 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 11:03:12,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 11:03:12,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 11:03:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-12-09 11:03:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 11:03:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-12-09 11:03:12,407 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 24 [2018-12-09 11:03:12,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:12,408 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-12-09 11:03:12,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 11:03:12,408 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-12-09 11:03:12,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 11:03:12,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:12,408 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:12,409 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:12,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:12,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2111042098, now seen corresponding path program 1 times [2018-12-09 11:03:12,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:12,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:12,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:12,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:12,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:12,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:03:12,615 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/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-12-09 11:03:12,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:12,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:03:12,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 11:03:12,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 11:03:12,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:03:12,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:03:12,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:03:12,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 11:03:12,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-12-09 11:03:12,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 11:03:12,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:03:12,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2018-12-09 11:03:12,903 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 11:03:12,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-12-09 11:03:12,928 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 11:03:12,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 11:03:12,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 11:03:12,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-12-09 11:03:12,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:13,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:03:13,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2018-12-09 11:03:13,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 11:03:13,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 11:03:13,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-12-09 11:03:13,001 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 22 states. [2018-12-09 11:03:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:15,813 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-12-09 11:03:15,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 11:03:15,813 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2018-12-09 11:03:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:15,814 INFO L225 Difference]: With dead ends: 44 [2018-12-09 11:03:15,814 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 11:03:15,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=126, Invalid=865, Unknown=1, NotChecked=0, Total=992 [2018-12-09 11:03:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 11:03:15,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 11:03:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 11:03:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-12-09 11:03:15,816 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 26 [2018-12-09 11:03:15,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:15,816 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-12-09 11:03:15,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 11:03:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-12-09 11:03:15,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 11:03:15,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:15,816 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:15,816 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:15,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:15,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1486892371, now seen corresponding path program 1 times [2018-12-09 11:03:15,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:15,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:15,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:15,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:15,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:15,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:03:15,850 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/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-12-09 11:03:15,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:15,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:03:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:15,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:03:15,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-09 11:03:15,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:03:15,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:03:15,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:03:15,888 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 6 states. [2018-12-09 11:03:15,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:15,921 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-12-09 11:03:15,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:03:15,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-09 11:03:15,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:15,922 INFO L225 Difference]: With dead ends: 42 [2018-12-09 11:03:15,922 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 11:03:15,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:03:15,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 11:03:15,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-12-09 11:03:15,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 11:03:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-09 11:03:15,923 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 28 [2018-12-09 11:03:15,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:15,923 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-09 11:03:15,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:03:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-09 11:03:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 11:03:15,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:15,924 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:15,924 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:15,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:15,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1320818060, now seen corresponding path program 1 times [2018-12-09 11:03:15,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:15,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:15,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:15,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:15,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:15,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:03:15,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/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-12-09 11:03:15,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:16,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:03:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:16,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 11:03:16,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2018-12-09 11:03:16,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 11:03:16,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 11:03:16,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-09 11:03:16,050 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 13 states. [2018-12-09 11:03:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:16,180 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-09 11:03:16,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 11:03:16,180 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-12-09 11:03:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:16,180 INFO L225 Difference]: With dead ends: 39 [2018-12-09 11:03:16,180 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 11:03:16,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-12-09 11:03:16,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 11:03:16,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-09 11:03:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 11:03:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-09 11:03:16,182 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2018-12-09 11:03:16,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:16,182 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-09 11:03:16,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 11:03:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-09 11:03:16,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 11:03:16,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:16,183 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:16,183 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:16,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:16,184 INFO L82 PathProgramCache]: Analyzing trace with hash -2024428204, now seen corresponding path program 1 times [2018-12-09 11:03:16,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:16,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:16,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:16,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:16,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:16,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:03:16,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/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-12-09 11:03:16,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:16,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:03:16,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 11:03:16,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 11:03:16,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:03:16,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:03:16,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-12-09 11:03:16,395 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 11:03:16,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:03:16,399 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-09 11:03:16,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 11:03:16,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 11:03:16,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:03:16,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:03:16,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:03:16,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-09 11:03:16,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-09 11:03:16,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-09 11:03:16,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:03:16,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:03:16,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 11:03:16,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-09 11:03:16,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-12-09 11:03:16,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-12-09 11:03:16,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 11:03:16,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-12-09 11:03:16,652 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 11:03:16,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 11:03:16,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 11:03:16,660 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-12-09 11:03:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:16,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:03:16,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2018-12-09 11:03:16,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 11:03:16,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 11:03:16,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-12-09 11:03:16,719 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 23 states. [2018-12-09 11:03:17,562 WARN L180 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2018-12-09 11:03:17,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:17,969 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-09 11:03:17,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 11:03:17,970 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2018-12-09 11:03:17,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:17,970 INFO L225 Difference]: With dead ends: 38 [2018-12-09 11:03:17,970 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 11:03:17,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=175, Invalid=1015, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 11:03:17,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 11:03:17,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-12-09 11:03:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 11:03:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-09 11:03:17,972 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-12-09 11:03:17,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:17,972 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-09 11:03:17,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 11:03:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-09 11:03:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 11:03:17,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:17,972 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:17,973 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:17,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:17,973 INFO L82 PathProgramCache]: Analyzing trace with hash 144680469, now seen corresponding path program 2 times [2018-12-09 11:03:17,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:17,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:17,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:17,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:03:17,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:18,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:03:18,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:03:18,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 11:03:18,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 11:03:18,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:03:18,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:03:18,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 11:03:18,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 11:03:18,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:03:18,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:03:18,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 11:03:18,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-12-09 11:03:19,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 46 [2018-12-09 11:03:19,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:03:19,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:03:19,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 72 [2018-12-09 11:03:19,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-09 11:03:19,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 28 [2018-12-09 11:03:19,104 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 11:03:19,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 11:03:19,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 39 [2018-12-09 11:03:19,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 11:03:19,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 11:03:19,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 11:03:19,155 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:70, output treesize:72 [2018-12-09 11:03:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:19,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:03:19,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 32 [2018-12-09 11:03:19,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-09 11:03:19,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-09 11:03:19,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 11:03:19,225 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 33 states. [2018-12-09 11:03:19,781 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2018-12-09 11:03:20,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:20,931 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-09 11:03:20,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 11:03:20,931 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 34 [2018-12-09 11:03:20,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:20,931 INFO L225 Difference]: With dead ends: 44 [2018-12-09 11:03:20,931 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 11:03:20,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=213, Invalid=2237, Unknown=0, NotChecked=0, Total=2450 [2018-12-09 11:03:20,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 11:03:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-12-09 11:03:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 11:03:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-09 11:03:20,933 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 34 [2018-12-09 11:03:20,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:20,933 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-09 11:03:20,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-09 11:03:20,933 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-09 11:03:20,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 11:03:20,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:03:20,933 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:03:20,933 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION]=== [2018-12-09 11:03:20,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:03:20,934 INFO L82 PathProgramCache]: Analyzing trace with hash -357120264, now seen corresponding path program 3 times [2018-12-09 11:03:20,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:03:20,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:03:20,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:20,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:03:20,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:03:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:03:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:21,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:03:21,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:03:21,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 11:03:21,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 11:03:21,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:03:21,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:03:21,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 11:03:21,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 11:03:21,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 11:03:21,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 11:03:21,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 11:03:21,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:28 [2018-12-09 11:03:21,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 11:03:21,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-09 11:03:21,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 11:03:21,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:03:21,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 11:03:21,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 11:03:21,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-12-09 11:03:21,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2018-12-09 11:03:21,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 11:03:21,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 11:03:21,411 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 11:03:21,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-09 11:03:21,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 11:03:21,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 11:03:21,427 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 11:03:21,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 11:03:21,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 11:03:21,435 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-12-09 11:03:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:03:21,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:03:21,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2018-12-09 11:03:21,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-09 11:03:21,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-09 11:03:21,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2018-12-09 11:03:21,513 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 29 states. [2018-12-09 11:03:23,371 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-12-09 11:03:23,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:03:23,374 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-09 11:03:23,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 11:03:23,375 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 42 [2018-12-09 11:03:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:03:23,375 INFO L225 Difference]: With dead ends: 51 [2018-12-09 11:03:23,375 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 11:03:23,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=413, Invalid=2893, Unknown=0, NotChecked=0, Total=3306 [2018-12-09 11:03:23,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 11:03:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 11:03:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 11:03:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 11:03:23,377 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-12-09 11:03:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:03:23,377 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 11:03:23,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-09 11:03:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 11:03:23,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 11:03:23,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 11:03:23 BoogieIcfgContainer [2018-12-09 11:03:23,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 11:03:23,383 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:03:23,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:03:23,383 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:03:23,384 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:03:10" (3/4) ... [2018-12-09 11:03:23,388 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 11:03:23,395 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 11:03:23,396 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-09 11:03:23,396 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-09 11:03:23,396 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 11:03:23,396 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncmp [2018-12-09 11:03:23,401 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-12-09 11:03:23,402 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 11:03:23,402 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 11:03:23,431 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6df9a390-a40d-4105-96a9-f759876abbf5/bin-2019/uautomizer/witness.graphml [2018-12-09 11:03:23,431 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:03:23,431 INFO L168 Benchmark]: Toolchain (without parser) took 13977.82 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.0 MB). Free memory was 950.6 MB in the beginning and 1.3 GB in the end (delta: -365.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:03:23,431 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:03:23,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-09 11:03:23,432 INFO L168 Benchmark]: Boogie Preprocessor took 31.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 11:03:23,432 INFO L168 Benchmark]: RCFGBuilder took 267.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. [2018-12-09 11:03:23,432 INFO L168 Benchmark]: TraceAbstraction took 13363.13 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 228.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -272.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:03:23,432 INFO L168 Benchmark]: Witness Printer took 47.60 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 658.3 kB). Peak memory consumption was 658.3 kB. Max. memory is 11.5 GB. [2018-12-09 11:03:23,433 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 267.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13363.13 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 228.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -272.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 47.60 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 658.3 kB). Peak memory consumption was 658.3 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 56 locations, 15 error locations. SAFE Result, 13.3s OverallTime, 21 OverallIterations, 4 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 586 SDtfs, 895 SDslu, 2413 SDs, 0 SdLazy, 2696 SolverSat, 166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 482 GetRequests, 174 SyntacticMatches, 8 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 31 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 669 NumberOfCodeBlocks, 669 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 641 ConstructedInterpolants, 45 QuantifiedInterpolants, 201165 SizeOfPredicates, 75 NumberOfNonLiveVariables, 1222 ConjunctsInSsa, 297 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 20/141 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...