./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/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 2d5a995d825785bc5dc95f3825623b1e4ecd07fe ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:03:52,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:03:52,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:03:52,867 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:03:52,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:03:52,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:03:52,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:03:52,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:03:52,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:03:52,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:03:52,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:03:52,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:03:52,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:03:52,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:03:52,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:03:52,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:03:52,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:03:52,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:03:52,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:03:52,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:03:52,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:03:52,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:03:52,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:03:52,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:03:52,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:03:52,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:03:52,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:03:52,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:03:52,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:03:52,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:03:52,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:03:52,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:03:52,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:03:52,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:03:52,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:03:52,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:03:52,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:03:52,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:03:52,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:03:52,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:03:52,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:03:52,924 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:03:52,948 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:03:52,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:03:52,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:03:52,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:03:52,950 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:03:52,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:03:52,951 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:03:52,951 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:03:52,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:03:52,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:03:52,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:03:52,952 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:03:52,952 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:03:52,952 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:03:52,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:03:52,953 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:03:52,953 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:03:52,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:03:52,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:03:52,953 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:03:52,954 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:03:52,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:03:52,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:03:52,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:03:52,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:03:52,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:03:52,955 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/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 -> 2d5a995d825785bc5dc95f3825623b1e4ecd07fe [2019-11-16 00:03:52,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:03:53,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:03:53,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:03:53,019 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:03:53,020 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:03:53,021 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2019-11-16 00:03:53,072 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/data/55704ba67/cf98873fd42242288535817172419399/FLAGe310fb875 [2019-11-16 00:03:53,563 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:03:53,563 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2019-11-16 00:03:53,578 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/data/55704ba67/cf98873fd42242288535817172419399/FLAGe310fb875 [2019-11-16 00:03:53,889 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/data/55704ba67/cf98873fd42242288535817172419399 [2019-11-16 00:03:53,891 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:03:53,893 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:03:53,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:03:53,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:03:53,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:03:53,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:53" (1/1) ... [2019-11-16 00:03:53,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8bf45f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:53, skipping insertion in model container [2019-11-16 00:03:53,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:53" (1/1) ... [2019-11-16 00:03:53,907 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:03:53,952 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:03:54,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:03:54,357 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:03:54,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:03:54,461 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:03:54,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:54 WrapperNode [2019-11-16 00:03:54,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:03:54,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:03:54,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:03:54,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:03:54,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:54" (1/1) ... [2019-11-16 00:03:54,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:54" (1/1) ... [2019-11-16 00:03:54,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:54" (1/1) ... [2019-11-16 00:03:54,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:54" (1/1) ... [2019-11-16 00:03:54,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:54" (1/1) ... [2019-11-16 00:03:54,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:54" (1/1) ... [2019-11-16 00:03:54,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:54" (1/1) ... [2019-11-16 00:03:54,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:03:54,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:03:54,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:03:54,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:03:54,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/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 [2019-11-16 00:03:54,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:03:54,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:03:54,615 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:03:54,615 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:03:54,615 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-16 00:03:54,616 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-16 00:03:54,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-16 00:03:54,617 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncmp [2019-11-16 00:03:54,617 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:03:54,618 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:03:54,618 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:03:54,618 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:03:54,619 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:03:54,619 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:03:54,619 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:03:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:03:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:03:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:03:54,622 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:03:54,623 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:03:54,623 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:03:54,623 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:03:54,623 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:03:54,624 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:03:54,624 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:03:54,624 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:03:54,624 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:03:54,626 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-16 00:03:54,626 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-16 00:03:54,626 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-16 00:03:54,627 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:03:54,627 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:03:54,627 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:03:54,627 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:03:54,627 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:03:54,627 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:03:54,628 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:03:54,628 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:03:54,628 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:03:54,628 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:03:54,628 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:03:54,628 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:03:54,629 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:03:54,629 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:03:54,629 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:03:54,629 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:03:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:03:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:03:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:03:54,632 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:03:54,632 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:03:54,632 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:03:54,632 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:03:54,632 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:03:54,632 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:03:54,633 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:03:54,633 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:03:54,633 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:03:54,633 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:03:54,633 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:03:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:03:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:03:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:03:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:03:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:03:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:03:54,636 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:03:54,636 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:03:54,636 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:03:54,636 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:03:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:03:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:03:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:03:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:03:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:03:54,639 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:03:54,639 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:03:54,639 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:03:54,640 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:03:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:03:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:03:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:03:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:03:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:03:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:03:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:03:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:03:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:03:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:03:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:03:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:03:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:03:54,644 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:03:54,644 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:03:54,644 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:03:54,644 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:03:54,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:03:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:03:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:03:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:03:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:03:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:03:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:03:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:03:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:03:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:03:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:03:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:03:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:03:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:03:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:03:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:03:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:03:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:03:54,648 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:03:54,648 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:03:54,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-16 00:03:54,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-16 00:03:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncmp [2019-11-16 00:03:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:03:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:03:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:03:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:03:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:03:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:03:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:03:55,300 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:03:55,300 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-16 00:03:55,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:55 BoogieIcfgContainer [2019-11-16 00:03:55,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:03:55,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:03:55,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:03:55,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:03:55,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:03:53" (1/3) ... [2019-11-16 00:03:55,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e3c124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:03:55, skipping insertion in model container [2019-11-16 00:03:55,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:54" (2/3) ... [2019-11-16 00:03:55,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e3c124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:03:55, skipping insertion in model container [2019-11-16 00:03:55,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:55" (3/3) ... [2019-11-16 00:03:55,308 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca-1.i [2019-11-16 00:03:55,317 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:03:55,324 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-11-16 00:03:55,331 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-11-16 00:03:55,345 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:03:55,345 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:03:55,345 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:03:55,345 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:03:55,345 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:03:55,346 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:03:55,346 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:03:55,346 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:03:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2019-11-16 00:03:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:03:55,368 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:55,369 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:55,371 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:03:55,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:55,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1980189205, now seen corresponding path program 1 times [2019-11-16 00:03:55,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:55,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415316083] [2019-11-16 00:03:55,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:55,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:55,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:55,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415316083] [2019-11-16 00:03:55,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:55,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:03:55,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524541002] [2019-11-16 00:03:55,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:03:55,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:55,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:55,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:55,581 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 5 states. [2019-11-16 00:03:55,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:55,847 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2019-11-16 00:03:55,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:03:55,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-16 00:03:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:55,859 INFO L225 Difference]: With dead ends: 88 [2019-11-16 00:03:55,859 INFO L226 Difference]: Without dead ends: 84 [2019-11-16 00:03:55,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:03:55,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-16 00:03:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 66. [2019-11-16 00:03:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-16 00:03:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2019-11-16 00:03:55,898 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 11 [2019-11-16 00:03:55,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:55,899 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2019-11-16 00:03:55,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:03:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2019-11-16 00:03:55,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:03:55,899 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:55,900 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:55,900 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:03:55,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:55,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1982036247, now seen corresponding path program 1 times [2019-11-16 00:03:55,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:55,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080658572] [2019-11-16 00:03:55,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:55,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:55,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:56,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080658572] [2019-11-16 00:03:56,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:56,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:03:56,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224534241] [2019-11-16 00:03:56,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:03:56,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:56,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:56,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:56,035 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 5 states. [2019-11-16 00:03:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:56,297 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-11-16 00:03:56,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:03:56,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-16 00:03:56,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:56,300 INFO L225 Difference]: With dead ends: 89 [2019-11-16 00:03:56,300 INFO L226 Difference]: Without dead ends: 89 [2019-11-16 00:03:56,301 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:03:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-16 00:03:56,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2019-11-16 00:03:56,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-16 00:03:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2019-11-16 00:03:56,311 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 11 [2019-11-16 00:03:56,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:56,311 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-11-16 00:03:56,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:03:56,311 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2019-11-16 00:03:56,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:03:56,312 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:56,312 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:56,312 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:03:56,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:56,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1982036246, now seen corresponding path program 1 times [2019-11-16 00:03:56,313 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:56,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400458712] [2019-11-16 00:03:56,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:56,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:56,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:56,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400458712] [2019-11-16 00:03:56,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:56,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:56,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357982539] [2019-11-16 00:03:56,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:03:56,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:56,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:56,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:56,403 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 4 states. [2019-11-16 00:03:56,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:56,568 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2019-11-16 00:03:56,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:03:56,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-16 00:03:56,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:56,570 INFO L225 Difference]: With dead ends: 66 [2019-11-16 00:03:56,570 INFO L226 Difference]: Without dead ends: 66 [2019-11-16 00:03:56,570 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:56,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-16 00:03:56,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-16 00:03:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-16 00:03:56,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2019-11-16 00:03:56,582 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 11 [2019-11-16 00:03:56,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:56,582 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2019-11-16 00:03:56,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:03:56,582 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2019-11-16 00:03:56,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:03:56,583 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:56,583 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:56,590 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:03:56,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:56,590 INFO L82 PathProgramCache]: Analyzing trace with hash 291262476, now seen corresponding path program 1 times [2019-11-16 00:03:56,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:56,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687393414] [2019-11-16 00:03:56,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:56,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:56,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:56,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687393414] [2019-11-16 00:03:56,686 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:56,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:03:56,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114089192] [2019-11-16 00:03:56,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:03:56,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:56,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:56,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:56,688 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand 5 states. [2019-11-16 00:03:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:56,841 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-11-16 00:03:56,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:03:56,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-16 00:03:56,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:56,842 INFO L225 Difference]: With dead ends: 65 [2019-11-16 00:03:56,842 INFO L226 Difference]: Without dead ends: 65 [2019-11-16 00:03:56,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:03:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-16 00:03:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-16 00:03:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-16 00:03:56,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2019-11-16 00:03:56,850 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 13 [2019-11-16 00:03:56,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:56,851 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2019-11-16 00:03:56,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:03:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2019-11-16 00:03:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:03:56,852 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:56,852 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:56,852 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:03:56,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:56,853 INFO L82 PathProgramCache]: Analyzing trace with hash 291262528, now seen corresponding path program 1 times [2019-11-16 00:03:56,853 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:56,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221291478] [2019-11-16 00:03:56,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:56,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:56,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:56,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221291478] [2019-11-16 00:03:56,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:56,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:56,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711681305] [2019-11-16 00:03:56,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:03:56,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:56,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:56,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:56,896 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 4 states. [2019-11-16 00:03:57,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:57,007 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2019-11-16 00:03:57,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:03:57,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-16 00:03:57,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:57,008 INFO L225 Difference]: With dead ends: 63 [2019-11-16 00:03:57,008 INFO L226 Difference]: Without dead ends: 63 [2019-11-16 00:03:57,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-16 00:03:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-16 00:03:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-16 00:03:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-11-16 00:03:57,014 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 13 [2019-11-16 00:03:57,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:57,015 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-11-16 00:03:57,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:03:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2019-11-16 00:03:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:03:57,015 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:57,016 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:57,016 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:03:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:57,016 INFO L82 PathProgramCache]: Analyzing trace with hash 291262529, now seen corresponding path program 1 times [2019-11-16 00:03:57,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:57,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619674190] [2019-11-16 00:03:57,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:57,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:57,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:57,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619674190] [2019-11-16 00:03:57,080 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:57,080 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:03:57,080 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902134867] [2019-11-16 00:03:57,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:03:57,081 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:57,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:57,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:57,081 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 5 states. [2019-11-16 00:03:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:57,246 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2019-11-16 00:03:57,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:03:57,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-16 00:03:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:57,247 INFO L225 Difference]: With dead ends: 83 [2019-11-16 00:03:57,247 INFO L226 Difference]: Without dead ends: 83 [2019-11-16 00:03:57,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:03:57,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-16 00:03:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2019-11-16 00:03:57,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-16 00:03:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2019-11-16 00:03:57,254 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 13 [2019-11-16 00:03:57,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:57,254 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2019-11-16 00:03:57,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:03:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2019-11-16 00:03:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:03:57,261 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:57,261 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:57,262 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:03:57,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:57,262 INFO L82 PathProgramCache]: Analyzing trace with hash 348520831, now seen corresponding path program 1 times [2019-11-16 00:03:57,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:57,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290906832] [2019-11-16 00:03:57,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:57,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:57,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:57,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290906832] [2019-11-16 00:03:57,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:57,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:03:57,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254374935] [2019-11-16 00:03:57,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:03:57,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:57,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:03:57,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:03:57,360 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand 6 states. [2019-11-16 00:03:57,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:57,555 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2019-11-16 00:03:57,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:03:57,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-16 00:03:57,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:57,559 INFO L225 Difference]: With dead ends: 86 [2019-11-16 00:03:57,559 INFO L226 Difference]: Without dead ends: 86 [2019-11-16 00:03:57,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:03:57,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-16 00:03:57,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-11-16 00:03:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-16 00:03:57,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2019-11-16 00:03:57,566 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 13 [2019-11-16 00:03:57,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:57,566 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2019-11-16 00:03:57,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:03:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2019-11-16 00:03:57,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:03:57,567 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:57,567 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:57,567 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:03:57,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:57,567 INFO L82 PathProgramCache]: Analyzing trace with hash 439202164, now seen corresponding path program 1 times [2019-11-16 00:03:57,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:57,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552117245] [2019-11-16 00:03:57,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:57,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:57,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:57,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552117245] [2019-11-16 00:03:57,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:57,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:03:57,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913174071] [2019-11-16 00:03:57,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:03:57,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:57,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:57,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:57,639 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 5 states. [2019-11-16 00:03:57,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:57,747 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-11-16 00:03:57,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:03:57,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-16 00:03:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:57,749 INFO L225 Difference]: With dead ends: 75 [2019-11-16 00:03:57,749 INFO L226 Difference]: Without dead ends: 75 [2019-11-16 00:03:57,749 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:03:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-16 00:03:57,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-16 00:03:57,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-16 00:03:57,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2019-11-16 00:03:57,754 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 14 [2019-11-16 00:03:57,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:57,755 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2019-11-16 00:03:57,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:03:57,755 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2019-11-16 00:03:57,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-16 00:03:57,756 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:57,756 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:57,756 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:03:57,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:57,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1458990554, now seen corresponding path program 1 times [2019-11-16 00:03:57,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:57,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338668946] [2019-11-16 00:03:57,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:57,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:57,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:57,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338668946] [2019-11-16 00:03:57,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936210371] [2019-11-16 00:03:57,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:57,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-16 00:03:57,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:58,019 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_33|]} [2019-11-16 00:03:58,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:58,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-16 00:03:58,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:58,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:58,067 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:03:58,068 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:58,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:58,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:03:58,078 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-11-16 00:03:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:58,092 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:58,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-16 00:03:58,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933923443] [2019-11-16 00:03:58,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:03:58,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:58,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:03:58,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:03:58,094 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 7 states. [2019-11-16 00:03:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:58,302 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2019-11-16 00:03:58,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:03:58,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-16 00:03:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:58,304 INFO L225 Difference]: With dead ends: 95 [2019-11-16 00:03:58,304 INFO L226 Difference]: Without dead ends: 95 [2019-11-16 00:03:58,304 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:03:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-16 00:03:58,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 70. [2019-11-16 00:03:58,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-16 00:03:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-11-16 00:03:58,309 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 15 [2019-11-16 00:03:58,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:58,309 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-11-16 00:03:58,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:03:58,309 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2019-11-16 00:03:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:03:58,310 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:58,310 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:58,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:58,511 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:03:58,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:58,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1456928450, now seen corresponding path program 1 times [2019-11-16 00:03:58,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:58,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671834666] [2019-11-16 00:03:58,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:58,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:58,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:58,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671834666] [2019-11-16 00:03:58,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340607628] [2019-11-16 00:03:58,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:58,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:03:58,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:58,765 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:58,766 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-16 00:03:58,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:58,789 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:03:58,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:03:58,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:03:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:58,810 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:58,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-11-16 00:03:58,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009414960] [2019-11-16 00:03:58,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:03:58,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:58,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:03:58,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:03:58,812 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 7 states. [2019-11-16 00:03:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:59,019 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2019-11-16 00:03:59,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:03:59,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-16 00:03:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:59,021 INFO L225 Difference]: With dead ends: 78 [2019-11-16 00:03:59,021 INFO L226 Difference]: Without dead ends: 78 [2019-11-16 00:03:59,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:03:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-16 00:03:59,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2019-11-16 00:03:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-16 00:03:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2019-11-16 00:03:59,026 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 17 [2019-11-16 00:03:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:59,026 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2019-11-16 00:03:59,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:03:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2019-11-16 00:03:59,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:03:59,027 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:59,027 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:59,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:59,231 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:03:59,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:59,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1817523924, now seen corresponding path program 1 times [2019-11-16 00:03:59,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:59,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007173561] [2019-11-16 00:03:59,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:59,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007173561] [2019-11-16 00:03:59,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:59,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:03:59,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002381791] [2019-11-16 00:03:59,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:03:59,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:59,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:03:59,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:03:59,276 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 6 states. [2019-11-16 00:03:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:59,412 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2019-11-16 00:03:59,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:03:59,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-16 00:03:59,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:59,414 INFO L225 Difference]: With dead ends: 64 [2019-11-16 00:03:59,414 INFO L226 Difference]: Without dead ends: 64 [2019-11-16 00:03:59,414 INFO L600 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 [2019-11-16 00:03:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-16 00:03:59,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-16 00:03:59,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-16 00:03:59,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-11-16 00:03:59,418 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 21 [2019-11-16 00:03:59,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:59,419 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-16 00:03:59,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:03:59,419 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-11-16 00:03:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:03:59,420 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:59,420 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:59,420 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:03:59,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:59,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1817523925, now seen corresponding path program 1 times [2019-11-16 00:03:59,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:59,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977148886] [2019-11-16 00:03:59,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:59,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:59,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977148886] [2019-11-16 00:03:59,552 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:59,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:03:59,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721537017] [2019-11-16 00:03:59,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:03:59,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:59,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:03:59,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:03:59,553 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 8 states. [2019-11-16 00:03:59,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:59,784 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-11-16 00:03:59,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:03:59,784 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-16 00:03:59,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:59,787 INFO L225 Difference]: With dead ends: 86 [2019-11-16 00:03:59,787 INFO L226 Difference]: Without dead ends: 86 [2019-11-16 00:03:59,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:03:59,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-16 00:03:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2019-11-16 00:03:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-16 00:03:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-11-16 00:03:59,792 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 21 [2019-11-16 00:03:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:59,792 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-11-16 00:03:59,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:03:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-11-16 00:03:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-16 00:03:59,793 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:59,794 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:59,794 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:03:59,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:59,794 INFO L82 PathProgramCache]: Analyzing trace with hash 509312965, now seen corresponding path program 1 times [2019-11-16 00:03:59,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:59,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240793979] [2019-11-16 00:03:59,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:59,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240793979] [2019-11-16 00:03:59,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:59,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:03:59,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041487159] [2019-11-16 00:03:59,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:03:59,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:59,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:59,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:59,858 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 5 states. [2019-11-16 00:03:59,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:59,964 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2019-11-16 00:03:59,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:03:59,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-16 00:03:59,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:59,965 INFO L225 Difference]: With dead ends: 72 [2019-11-16 00:03:59,965 INFO L226 Difference]: Without dead ends: 65 [2019-11-16 00:03:59,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:59,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-16 00:03:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-16 00:03:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-16 00:03:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-11-16 00:03:59,969 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 22 [2019-11-16 00:03:59,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:59,969 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-11-16 00:03:59,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:03:59,969 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-11-16 00:03:59,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-16 00:03:59,970 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:59,970 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:59,970 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:03:59,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:59,971 INFO L82 PathProgramCache]: Analyzing trace with hash 508666854, now seen corresponding path program 1 times [2019-11-16 00:03:59,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:59,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104757874] [2019-11-16 00:03:59,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:00,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104757874] [2019-11-16 00:04:00,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:00,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:04:00,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759811699] [2019-11-16 00:04:00,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:04:00,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:00,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:04:00,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:04:00,019 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 6 states. [2019-11-16 00:04:00,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:00,138 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2019-11-16 00:04:00,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:04:00,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-16 00:04:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:00,139 INFO L225 Difference]: With dead ends: 63 [2019-11-16 00:04:00,140 INFO L226 Difference]: Without dead ends: 63 [2019-11-16 00:04:00,140 INFO L600 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 [2019-11-16 00:04:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-16 00:04:00,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-16 00:04:00,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-16 00:04:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-11-16 00:04:00,142 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 22 [2019-11-16 00:04:00,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:00,143 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-11-16 00:04:00,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:04:00,143 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-11-16 00:04:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-16 00:04:00,144 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:00,144 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:00,144 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:00,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:00,144 INFO L82 PathProgramCache]: Analyzing trace with hash 508666855, now seen corresponding path program 1 times [2019-11-16 00:04:00,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:00,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769760698] [2019-11-16 00:04:00,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:00,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:00,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:00,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769760698] [2019-11-16 00:04:00,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:00,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:04:00,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586490843] [2019-11-16 00:04:00,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:04:00,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:00,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:04:00,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:04:00,237 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 8 states. [2019-11-16 00:04:00,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:00,438 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-11-16 00:04:00,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:04:00,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-16 00:04:00,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:00,439 INFO L225 Difference]: With dead ends: 67 [2019-11-16 00:04:00,439 INFO L226 Difference]: Without dead ends: 64 [2019-11-16 00:04:00,439 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:04:00,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-16 00:04:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-16 00:04:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-16 00:04:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2019-11-16 00:04:00,442 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 22 [2019-11-16 00:04:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:00,442 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-11-16 00:04:00,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:04:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2019-11-16 00:04:00,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:04:00,444 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:00,444 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:00,444 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:00,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:00,444 INFO L82 PathProgramCache]: Analyzing trace with hash -2007435023, now seen corresponding path program 1 times [2019-11-16 00:04:00,444 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:00,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245751551] [2019-11-16 00:04:00,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:00,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:00,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:00,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245751551] [2019-11-16 00:04:00,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:00,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:04:00,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733704559] [2019-11-16 00:04:00,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:04:00,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:00,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:04:00,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:04:00,496 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 4 states. [2019-11-16 00:04:00,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:00,587 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-11-16 00:04:00,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:04:00,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-16 00:04:00,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:00,588 INFO L225 Difference]: With dead ends: 64 [2019-11-16 00:04:00,588 INFO L226 Difference]: Without dead ends: 63 [2019-11-16 00:04:00,588 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:04:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-16 00:04:00,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-16 00:04:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-16 00:04:00,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2019-11-16 00:04:00,591 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 26 [2019-11-16 00:04:00,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:00,591 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2019-11-16 00:04:00,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:04:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2019-11-16 00:04:00,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-16 00:04:00,592 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:00,593 INFO L380 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, 1, 1, 1] [2019-11-16 00:04:00,593 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:00,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:00,593 INFO L82 PathProgramCache]: Analyzing trace with hash 489090044, now seen corresponding path program 1 times [2019-11-16 00:04:00,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:00,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24383493] [2019-11-16 00:04:00,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:00,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:00,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:00,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:00,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24383493] [2019-11-16 00:04:00,651 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:00,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:04:00,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686485123] [2019-11-16 00:04:00,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:04:00,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:00,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:04:00,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:04:00,652 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 4 states. [2019-11-16 00:04:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:00,729 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-11-16 00:04:00,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:04:00,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-16 00:04:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:00,731 INFO L225 Difference]: With dead ends: 64 [2019-11-16 00:04:00,731 INFO L226 Difference]: Without dead ends: 63 [2019-11-16 00:04:00,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:04:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-16 00:04:00,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-16 00:04:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-16 00:04:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2019-11-16 00:04:00,733 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 29 [2019-11-16 00:04:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:00,734 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2019-11-16 00:04:00,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:04:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2019-11-16 00:04:00,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:04:00,735 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:00,735 INFO L380 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, 1, 1, 1, 1, 1] [2019-11-16 00:04:00,735 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:00,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:00,735 INFO L82 PathProgramCache]: Analyzing trace with hash -859100191, now seen corresponding path program 1 times [2019-11-16 00:04:00,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:00,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432273687] [2019-11-16 00:04:00,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:00,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:00,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:00,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432273687] [2019-11-16 00:04:00,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:00,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-16 00:04:00,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713398940] [2019-11-16 00:04:00,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:04:00,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:00,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:04:00,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:04:00,915 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 14 states. [2019-11-16 00:04:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:01,404 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2019-11-16 00:04:01,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:04:01,405 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-16 00:04:01,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:01,406 INFO L225 Difference]: With dead ends: 79 [2019-11-16 00:04:01,406 INFO L226 Difference]: Without dead ends: 54 [2019-11-16 00:04:01,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:04:01,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-16 00:04:01,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-16 00:04:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-16 00:04:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-16 00:04:01,408 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 31 [2019-11-16 00:04:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:01,409 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-16 00:04:01,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:04:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-16 00:04:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:04:01,410 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:01,410 INFO L380 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, 1, 1, 1, 1, 1] [2019-11-16 00:04:01,410 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:01,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:01,410 INFO L82 PathProgramCache]: Analyzing trace with hash -993113697, now seen corresponding path program 1 times [2019-11-16 00:04:01,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:01,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581570175] [2019-11-16 00:04:01,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:01,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:01,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:01,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:01,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581570175] [2019-11-16 00:04:01,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:01,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-16 00:04:01,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807209310] [2019-11-16 00:04:01,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:04:01,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:01,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:04:01,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:04:01,688 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 16 states. [2019-11-16 00:04:02,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:02,359 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2019-11-16 00:04:02,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:04:02,360 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-16 00:04:02,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:02,361 INFO L225 Difference]: With dead ends: 74 [2019-11-16 00:04:02,361 INFO L226 Difference]: Without dead ends: 58 [2019-11-16 00:04:02,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2019-11-16 00:04:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-16 00:04:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-11-16 00:04:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-16 00:04:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-11-16 00:04:02,364 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 31 [2019-11-16 00:04:02,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:02,365 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-11-16 00:04:02,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:04:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-11-16 00:04:02,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:04:02,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:02,366 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:02,366 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:02,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:02,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2046585822, now seen corresponding path program 1 times [2019-11-16 00:04:02,366 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:02,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282631932] [2019-11-16 00:04:02,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:02,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:02,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:04:02,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282631932] [2019-11-16 00:04:02,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:02,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:04:02,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423928208] [2019-11-16 00:04:02,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:04:02,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:02,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:04:02,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:04:02,604 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 10 states. [2019-11-16 00:04:03,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:03,022 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-11-16 00:04:03,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:04:03,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-11-16 00:04:03,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:03,024 INFO L225 Difference]: With dead ends: 77 [2019-11-16 00:04:03,024 INFO L226 Difference]: Without dead ends: 52 [2019-11-16 00:04:03,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:04:03,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-16 00:04:03,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-16 00:04:03,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-16 00:04:03,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-11-16 00:04:03,027 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 35 [2019-11-16 00:04:03,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:03,027 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-11-16 00:04:03,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:04:03,027 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-11-16 00:04:03,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:04:03,028 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:03,028 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:03,028 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:03,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:03,029 INFO L82 PathProgramCache]: Analyzing trace with hash -660382428, now seen corresponding path program 1 times [2019-11-16 00:04:03,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:03,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143906512] [2019-11-16 00:04:03,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:03,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:03,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:03,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:04:03,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143906512] [2019-11-16 00:04:03,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:03,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-16 00:04:03,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887070389] [2019-11-16 00:04:03,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:04:03,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:03,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:04:03,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:04:03,268 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 11 states. [2019-11-16 00:04:03,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:03,660 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-11-16 00:04:03,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:04:03,661 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-11-16 00:04:03,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:03,661 INFO L225 Difference]: With dead ends: 78 [2019-11-16 00:04:03,661 INFO L226 Difference]: Without dead ends: 56 [2019-11-16 00:04:03,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:04:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-16 00:04:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-11-16 00:04:03,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-16 00:04:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-11-16 00:04:03,664 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 35 [2019-11-16 00:04:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:03,665 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-11-16 00:04:03,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:04:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-11-16 00:04:03,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-16 00:04:03,665 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:03,666 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:03,666 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:03,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:03,666 INFO L82 PathProgramCache]: Analyzing trace with hash -865900057, now seen corresponding path program 1 times [2019-11-16 00:04:03,666 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:03,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092499550] [2019-11-16 00:04:03,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:03,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:03,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:03,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:04:03,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092499550] [2019-11-16 00:04:03,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490880487] [2019-11-16 00:04:03,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:03,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:04:03,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:04,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:04:04,084 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:04,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-16 00:04:04,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070182420] [2019-11-16 00:04:04,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:04:04,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:04,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:04:04,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:04:04,087 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 16 states. [2019-11-16 00:04:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:04,674 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-16 00:04:04,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:04:04,677 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-11-16 00:04:04,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:04,678 INFO L225 Difference]: With dead ends: 71 [2019-11-16 00:04:04,678 INFO L226 Difference]: Without dead ends: 71 [2019-11-16 00:04:04,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:04:04,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-16 00:04:04,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2019-11-16 00:04:04,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-16 00:04:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2019-11-16 00:04:04,681 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 39 [2019-11-16 00:04:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:04,682 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2019-11-16 00:04:04,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:04:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2019-11-16 00:04:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-16 00:04:04,682 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:04,683 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:04,889 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:04,889 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:04,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:04,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1073097963, now seen corresponding path program 1 times [2019-11-16 00:04:04,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:04,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143829336] [2019-11-16 00:04:04,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:04,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:04,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:04:05,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143829336] [2019-11-16 00:04:05,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101034737] [2019-11-16 00:04:05,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:05,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:04:05,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:04:05,361 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:05,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-16 00:04:05,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687720092] [2019-11-16 00:04:05,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:04:05,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:05,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:04:05,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:04:05,363 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 16 states. [2019-11-16 00:04:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:05,866 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-16 00:04:05,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:04:05,866 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-11-16 00:04:05,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:05,866 INFO L225 Difference]: With dead ends: 69 [2019-11-16 00:04:05,867 INFO L226 Difference]: Without dead ends: 65 [2019-11-16 00:04:05,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:04:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-16 00:04:05,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-11-16 00:04:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-16 00:04:05,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2019-11-16 00:04:05,869 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 40 [2019-11-16 00:04:05,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:05,869 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2019-11-16 00:04:05,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:04:05,870 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2019-11-16 00:04:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:04:05,870 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:05,870 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:06,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:06,074 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:06,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:06,074 INFO L82 PathProgramCache]: Analyzing trace with hash -83218317, now seen corresponding path program 2 times [2019-11-16 00:04:06,074 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:06,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699509563] [2019-11-16 00:04:06,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:06,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:06,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:04:06,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699509563] [2019-11-16 00:04:06,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499839434] [2019-11-16 00:04:06,463 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:06,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:04:06,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:06,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-16 00:04:06,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:06,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-16 00:04:06,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:06,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:06,739 INFO L496 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. [2019-11-16 00:04:06,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-16 00:04:07,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:07,206 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:07,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 48 [2019-11-16 00:04:07,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:07,222 INFO L567 ElimStorePlain]: treesize reduction 23, result has 30.3 percent of original size [2019-11-16 00:04:07,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:07,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:3 [2019-11-16 00:04:07,293 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:04:07,294 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:07,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2019-11-16 00:04:07,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282966830] [2019-11-16 00:04:07,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-16 00:04:07,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:07,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-16 00:04:07,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2019-11-16 00:04:07,296 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 27 states. [2019-11-16 00:04:09,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:09,721 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2019-11-16 00:04:09,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-16 00:04:09,721 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 49 [2019-11-16 00:04:09,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:09,722 INFO L225 Difference]: With dead ends: 168 [2019-11-16 00:04:09,722 INFO L226 Difference]: Without dead ends: 77 [2019-11-16 00:04:09,724 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=405, Invalid=3017, Unknown=0, NotChecked=0, Total=3422 [2019-11-16 00:04:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-16 00:04:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2019-11-16 00:04:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-16 00:04:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-11-16 00:04:09,726 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 49 [2019-11-16 00:04:09,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:09,727 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-11-16 00:04:09,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-16 00:04:09,727 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-11-16 00:04:09,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-16 00:04:09,727 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:09,727 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:09,931 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:09,931 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:09,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:09,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2107871545, now seen corresponding path program 3 times [2019-11-16 00:04:09,932 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:09,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404748473] [2019-11-16 00:04:09,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:09,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:09,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:04:10,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404748473] [2019-11-16 00:04:10,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779068924] [2019-11-16 00:04:10,075 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:10,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-16 00:04:10,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:10,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:04:10,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:04:10,376 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:10,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-16 00:04:10,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904651062] [2019-11-16 00:04:10,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-16 00:04:10,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:10,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:04:10,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:04:10,377 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 18 states. [2019-11-16 00:04:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:10,776 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-11-16 00:04:10,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:04:10,777 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-11-16 00:04:10,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:10,777 INFO L225 Difference]: With dead ends: 89 [2019-11-16 00:04:10,777 INFO L226 Difference]: Without dead ends: 89 [2019-11-16 00:04:10,778 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:04:10,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-16 00:04:10,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-11-16 00:04:10,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-16 00:04:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2019-11-16 00:04:10,781 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 57 [2019-11-16 00:04:10,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:10,781 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2019-11-16 00:04:10,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-16 00:04:10,781 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2019-11-16 00:04:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-16 00:04:10,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:10,782 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:10,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:10,982 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:10,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:10,983 INFO L82 PathProgramCache]: Analyzing trace with hash 919508483, now seen corresponding path program 2 times [2019-11-16 00:04:10,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:10,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88563185] [2019-11-16 00:04:10,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:10,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:10,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:04:11,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88563185] [2019-11-16 00:04:11,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65915843] [2019-11-16 00:04:11,134 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:11,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:04:11,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:11,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:04:11,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:04:11,397 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:11,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-11-16 00:04:11,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521905467] [2019-11-16 00:04:11,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-16 00:04:11,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:11,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-16 00:04:11,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:04:11,398 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 19 states. [2019-11-16 00:04:11,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:11,782 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-11-16 00:04:11,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:04:11,782 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2019-11-16 00:04:11,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:11,783 INFO L225 Difference]: With dead ends: 87 [2019-11-16 00:04:11,783 INFO L226 Difference]: Without dead ends: 83 [2019-11-16 00:04:11,783 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:04:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-16 00:04:11,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-16 00:04:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-16 00:04:11,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2019-11-16 00:04:11,786 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 58 [2019-11-16 00:04:11,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:11,786 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2019-11-16 00:04:11,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-16 00:04:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2019-11-16 00:04:11,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:04:11,787 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:11,787 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:11,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:11,988 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:11,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:11,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1530472123, now seen corresponding path program 4 times [2019-11-16 00:04:11,988 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:11,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327397363] [2019-11-16 00:04:11,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:11,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:11,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:04:12,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327397363] [2019-11-16 00:04:12,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587854023] [2019-11-16 00:04:12,272 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:12,426 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:04:12,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:12,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-16 00:04:12,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:12,441 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_26|], 1=[|v_#valid_34|]} [2019-11-16 00:04:12,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:04:12,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-16 00:04:12,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:12,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:12,467 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:04:12,467 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:12,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:12,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:12,481 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2019-11-16 00:04:12,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-16 00:04:12,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:12,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:12,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:12,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-16 00:04:12,704 INFO L375 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 28 treesize of output 27 [2019-11-16 00:04:12,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:12,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:12,715 INFO L496 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. [2019-11-16 00:04:12,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-11-16 00:04:13,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 treesize of output 28 [2019-11-16 00:04:13,093 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:04:13,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:13,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-16 00:04:13,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:35 [2019-11-16 00:04:13,189 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:04:13,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 10 [2019-11-16 00:04:13,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:13,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:13,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:13,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:42, output treesize:3 [2019-11-16 00:04:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:04:13,224 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:13,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2019-11-16 00:04:13,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413560759] [2019-11-16 00:04:13,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-16 00:04:13,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:13,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-16 00:04:13,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2019-11-16 00:04:13,226 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 27 states. [2019-11-16 00:04:18,738 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-11-16 00:04:20,873 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-16 00:04:22,983 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-16 00:04:23,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:23,103 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2019-11-16 00:04:23,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:04:23,103 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 67 [2019-11-16 00:04:23,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:23,104 INFO L225 Difference]: With dead ends: 134 [2019-11-16 00:04:23,104 INFO L226 Difference]: Without dead ends: 88 [2019-11-16 00:04:23,105 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=195, Invalid=1445, Unknown=0, NotChecked=0, Total=1640 [2019-11-16 00:04:23,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-16 00:04:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2019-11-16 00:04:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-16 00:04:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2019-11-16 00:04:23,108 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 67 [2019-11-16 00:04:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:23,108 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2019-11-16 00:04:23,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-16 00:04:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2019-11-16 00:04:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-16 00:04:23,109 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:23,109 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:23,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:23,310 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:23,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:23,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1867834872, now seen corresponding path program 5 times [2019-11-16 00:04:23,310 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:23,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187075783] [2019-11-16 00:04:23,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:23,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:23,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:04:23,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187075783] [2019-11-16 00:04:23,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804690775] [2019-11-16 00:04:23,498 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:23,634 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-16 00:04:23,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:23,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-16 00:04:23,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:04:23,775 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:23,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2019-11-16 00:04:23,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670085256] [2019-11-16 00:04:23,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-16 00:04:23,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:23,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-16 00:04:23,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:04:23,776 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 21 states. [2019-11-16 00:04:24,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:24,491 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2019-11-16 00:04:24,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:04:24,491 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2019-11-16 00:04:24,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:24,492 INFO L225 Difference]: With dead ends: 103 [2019-11-16 00:04:24,492 INFO L226 Difference]: Without dead ends: 103 [2019-11-16 00:04:24,493 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:04:24,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-16 00:04:24,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2019-11-16 00:04:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-16 00:04:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2019-11-16 00:04:24,496 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 71 [2019-11-16 00:04:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:24,496 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2019-11-16 00:04:24,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-16 00:04:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2019-11-16 00:04:24,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:04:24,497 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:24,497 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:24,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:24,698 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2068306156, now seen corresponding path program 3 times [2019-11-16 00:04:24,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:24,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634905769] [2019-11-16 00:04:24,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:24,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:24,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:25,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634905769] [2019-11-16 00:04:25,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966841315] [2019-11-16 00:04:25,465 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:25,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-16 00:04:25,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:25,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-16 00:04:25,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:25,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-16 00:04:25,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:25,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:25,750 INFO L496 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. [2019-11-16 00:04:25,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-16 00:04:25,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:26,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:04:26,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:26,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:26,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:26,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-16 00:04:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:04:26,053 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:26,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 34 [2019-11-16 00:04:26,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341884784] [2019-11-16 00:04:26,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-16 00:04:26,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:26,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-16 00:04:26,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1032, Unknown=0, NotChecked=0, Total=1122 [2019-11-16 00:04:26,054 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 34 states. [2019-11-16 00:04:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:27,767 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2019-11-16 00:04:27,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-16 00:04:27,767 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2019-11-16 00:04:27,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:27,768 INFO L225 Difference]: With dead ends: 143 [2019-11-16 00:04:27,768 INFO L226 Difference]: Without dead ends: 107 [2019-11-16 00:04:27,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=265, Invalid=2491, Unknown=0, NotChecked=0, Total=2756 [2019-11-16 00:04:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-16 00:04:27,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2019-11-16 00:04:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-16 00:04:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2019-11-16 00:04:27,772 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 72 [2019-11-16 00:04:27,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:27,773 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2019-11-16 00:04:27,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-16 00:04:27,773 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2019-11-16 00:04:27,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-16 00:04:27,774 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:27,774 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:27,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:27,975 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:27,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:27,975 INFO L82 PathProgramCache]: Analyzing trace with hash 471014641, now seen corresponding path program 4 times [2019-11-16 00:04:27,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:27,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898804765] [2019-11-16 00:04:27,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:27,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:27,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 49 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:04:28,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898804765] [2019-11-16 00:04:28,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799032289] [2019-11-16 00:04:28,187 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:28,344 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:04:28,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:28,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-16 00:04:28,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:28,362 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:28,362 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-16 00:04:28,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:28,379 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:04:28,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:28,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:04:28,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-16 00:04:28,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:28,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:28,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:28,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-16 00:04:28,918 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:28,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 50 [2019-11-16 00:04:28,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:28,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:28,937 INFO L496 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. [2019-11-16 00:04:28,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:40 [2019-11-16 00:04:29,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:29,122 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 8 proven. 49 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:04:29,122 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:29,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 27 [2019-11-16 00:04:29,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452092256] [2019-11-16 00:04:29,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-16 00:04:29,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:29,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-16 00:04:29,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:04:29,124 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 28 states. [2019-11-16 00:04:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:30,440 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-11-16 00:04:30,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:04:30,440 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 76 [2019-11-16 00:04:30,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:30,441 INFO L225 Difference]: With dead ends: 105 [2019-11-16 00:04:30,441 INFO L226 Difference]: Without dead ends: 101 [2019-11-16 00:04:30,442 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=202, Invalid=1438, Unknown=0, NotChecked=0, Total=1640 [2019-11-16 00:04:30,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-16 00:04:30,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-11-16 00:04:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-16 00:04:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2019-11-16 00:04:30,460 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 76 [2019-11-16 00:04:30,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:30,461 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2019-11-16 00:04:30,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-16 00:04:30,461 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2019-11-16 00:04:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:04:30,462 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:30,462 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:30,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:30,662 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:30,663 INFO L82 PathProgramCache]: Analyzing trace with hash -109036009, now seen corresponding path program 6 times [2019-11-16 00:04:30,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:30,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557363765] [2019-11-16 00:04:30,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:30,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:30,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 75 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:04:31,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557363765] [2019-11-16 00:04:31,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497063041] [2019-11-16 00:04:31,059 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:31,240 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-16 00:04:31,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:31,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-16 00:04:31,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:31,248 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:04:31,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:31,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:31,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:31,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-16 00:04:31,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-16 00:04:31,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:31,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:31,395 INFO L496 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. [2019-11-16 00:04:31,395 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-11-16 00:04:31,435 INFO L375 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 25 treesize of output 24 [2019-11-16 00:04:31,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:31,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:31,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-16 00:04:31,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:31 [2019-11-16 00:04:31,882 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:31,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2019-11-16 00:04:31,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:04:31,900 INFO L567 ElimStorePlain]: treesize reduction 8, result has 63.6 percent of original size [2019-11-16 00:04:31,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:31,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:38, output treesize:3 [2019-11-16 00:04:31,948 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 75 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:04:31,948 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:31,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2019-11-16 00:04:31,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409077102] [2019-11-16 00:04:31,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-16 00:04:31,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:31,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-16 00:04:31,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2019-11-16 00:04:31,950 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 30 states. [2019-11-16 00:04:34,919 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-16 00:04:35,853 WARN L191 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-16 00:04:40,080 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-16 00:04:44,299 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-11-16 00:04:48,395 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-16 00:04:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:48,501 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2019-11-16 00:04:48,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:04:48,502 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 85 [2019-11-16 00:04:48,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:48,502 INFO L225 Difference]: With dead ends: 166 [2019-11-16 00:04:48,502 INFO L226 Difference]: Without dead ends: 106 [2019-11-16 00:04:48,503 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=163, Invalid=1477, Unknown=0, NotChecked=0, Total=1640 [2019-11-16 00:04:48,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-16 00:04:48,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2019-11-16 00:04:48,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-16 00:04:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 106 transitions. [2019-11-16 00:04:48,506 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 106 transitions. Word has length 85 [2019-11-16 00:04:48,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:48,506 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 106 transitions. [2019-11-16 00:04:48,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-16 00:04:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2019-11-16 00:04:48,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:04:48,507 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:48,507 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:48,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:48,707 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:48,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:48,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1973220378, now seen corresponding path program 7 times [2019-11-16 00:04:48,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:48,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722101173] [2019-11-16 00:04:48,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:48,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:48,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 17 proven. 83 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:04:49,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722101173] [2019-11-16 00:04:49,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732132451] [2019-11-16 00:04:49,022 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:49,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-16 00:04:49,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:49,334 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 85 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:04:49,335 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:49,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2019-11-16 00:04:49,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089678566] [2019-11-16 00:04:49,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-16 00:04:49,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:49,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-16 00:04:49,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:04:49,337 INFO L87 Difference]: Start difference. First operand 103 states and 106 transitions. Second operand 25 states. [2019-11-16 00:04:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:49,953 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2019-11-16 00:04:49,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:04:49,953 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 89 [2019-11-16 00:04:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:49,954 INFO L225 Difference]: With dead ends: 121 [2019-11-16 00:04:49,954 INFO L226 Difference]: Without dead ends: 121 [2019-11-16 00:04:49,955 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2019-11-16 00:04:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-16 00:04:49,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2019-11-16 00:04:49,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-16 00:04:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2019-11-16 00:04:49,957 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 89 [2019-11-16 00:04:49,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:49,958 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2019-11-16 00:04:49,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-16 00:04:49,958 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2019-11-16 00:04:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-16 00:04:49,959 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:49,959 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:50,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:50,162 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:50,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1040289602, now seen corresponding path program 5 times [2019-11-16 00:04:50,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:50,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534584186] [2019-11-16 00:04:50,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:50,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:50,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 16 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:51,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534584186] [2019-11-16 00:04:51,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583295810] [2019-11-16 00:04:51,022 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:51,230 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-16 00:04:51,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:51,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-16 00:04:51,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:51,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-16 00:04:51,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:51,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:51,418 INFO L496 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. [2019-11-16 00:04:51,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-16 00:04:51,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:51,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:04:51,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:51,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:51,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:51,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-16 00:04:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-16 00:04:51,750 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:51,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20] total 38 [2019-11-16 00:04:51,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088306947] [2019-11-16 00:04:51,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-16 00:04:51,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:51,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-16 00:04:51,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1306, Unknown=0, NotChecked=0, Total=1406 [2019-11-16 00:04:51,772 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 38 states. [2019-11-16 00:04:53,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:53,837 INFO L93 Difference]: Finished difference Result 171 states and 177 transitions. [2019-11-16 00:04:53,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-16 00:04:53,838 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 90 [2019-11-16 00:04:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:53,839 INFO L225 Difference]: With dead ends: 171 [2019-11-16 00:04:53,839 INFO L226 Difference]: Without dead ends: 125 [2019-11-16 00:04:53,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=290, Invalid=3132, Unknown=0, NotChecked=0, Total=3422 [2019-11-16 00:04:53,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-16 00:04:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2019-11-16 00:04:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-16 00:04:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2019-11-16 00:04:53,843 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 90 [2019-11-16 00:04:53,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:53,844 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2019-11-16 00:04:53,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-16 00:04:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2019-11-16 00:04:53,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:04:53,845 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:53,845 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:54,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:54,046 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:54,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:54,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1006630945, now seen corresponding path program 6 times [2019-11-16 00:04:54,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:54,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393887617] [2019-11-16 00:04:54,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:54,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:54,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 17 proven. 87 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-16 00:04:54,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393887617] [2019-11-16 00:04:54,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232168408] [2019-11-16 00:04:54,349 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:54,557 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-16 00:04:54,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:54,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-16 00:04:54,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:54,582 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:54,582 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-16 00:04:54,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:54,605 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:04:54,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:54,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:04:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 15 proven. 89 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-16 00:04:55,034 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:55,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2019-11-16 00:04:55,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741163029] [2019-11-16 00:04:55,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-16 00:04:55,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:55,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-16 00:04:55,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-11-16 00:04:55,037 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand 29 states. [2019-11-16 00:04:56,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:56,156 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2019-11-16 00:04:56,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:04:56,156 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 94 [2019-11-16 00:04:56,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:56,157 INFO L225 Difference]: With dead ends: 123 [2019-11-16 00:04:56,158 INFO L226 Difference]: Without dead ends: 119 [2019-11-16 00:04:56,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=1079, Unknown=0, NotChecked=0, Total=1260 [2019-11-16 00:04:56,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-16 00:04:56,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-11-16 00:04:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-16 00:04:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2019-11-16 00:04:56,161 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 94 [2019-11-16 00:04:56,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:56,162 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2019-11-16 00:04:56,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-16 00:04:56,162 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2019-11-16 00:04:56,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-16 00:04:56,163 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:56,164 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:56,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:56,368 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:04:56,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:56,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1195262231, now seen corresponding path program 8 times [2019-11-16 00:04:56,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:56,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122963957] [2019-11-16 00:04:56,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:56,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:56,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 15 proven. 128 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-16 00:04:56,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122963957] [2019-11-16 00:04:56,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233356538] [2019-11-16 00:04:56,916 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:57,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:04:57,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:57,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-16 00:04:57,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:57,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-16 00:04:57,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:57,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:57,284 INFO L496 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. [2019-11-16 00:04:57,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-16 00:04:57,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:58,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:04:58,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:58,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:58,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:58,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-16 00:04:58,216 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 15 proven. 128 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-16 00:04:58,216 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:58,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 36 [2019-11-16 00:04:58,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331187121] [2019-11-16 00:04:58,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-16 00:04:58,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:58,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-16 00:04:58,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1187, Unknown=0, NotChecked=0, Total=1260 [2019-11-16 00:04:58,219 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand 36 states. [2019-11-16 00:05:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:03,497 INFO L93 Difference]: Finished difference Result 324 states and 328 transitions. [2019-11-16 00:05:03,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-11-16 00:05:03,497 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 103 [2019-11-16 00:05:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:03,498 INFO L225 Difference]: With dead ends: 324 [2019-11-16 00:05:03,499 INFO L226 Difference]: Without dead ends: 131 [2019-11-16 00:05:03,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=492, Invalid=6150, Unknown=0, NotChecked=0, Total=6642 [2019-11-16 00:05:03,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-16 00:05:03,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2019-11-16 00:05:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-16 00:05:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2019-11-16 00:05:03,505 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 103 [2019-11-16 00:05:03,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:03,505 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2019-11-16 00:05:03,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-16 00:05:03,505 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2019-11-16 00:05:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-16 00:05:03,506 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:03,506 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:05:03,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:05:03,711 INFO L410 AbstractCegarLoop]: === Iteration 36 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:05:03,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:03,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1001385775, now seen corresponding path program 9 times [2019-11-16 00:05:03,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:03,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122589910] [2019-11-16 00:05:03,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:03,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:03,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 30 proven. 130 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:05:04,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122589910] [2019-11-16 00:05:04,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170646273] [2019-11-16 00:05:04,106 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:05:04,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-16 00:05:04,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:05:04,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-16 00:05:04,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 28 proven. 132 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:05:04,761 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:05:04,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 25 [2019-11-16 00:05:04,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351353144] [2019-11-16 00:05:04,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-16 00:05:04,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:04,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-16 00:05:04,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-11-16 00:05:04,763 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand 26 states. [2019-11-16 00:05:05,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:05,741 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2019-11-16 00:05:05,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:05:05,741 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 111 [2019-11-16 00:05:05,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:05,742 INFO L225 Difference]: With dead ends: 143 [2019-11-16 00:05:05,742 INFO L226 Difference]: Without dead ends: 143 [2019-11-16 00:05:05,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2019-11-16 00:05:05,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-16 00:05:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2019-11-16 00:05:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-16 00:05:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2019-11-16 00:05:05,746 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 111 [2019-11-16 00:05:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:05,747 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2019-11-16 00:05:05,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-16 00:05:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2019-11-16 00:05:05,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-16 00:05:05,748 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:05,748 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:05:05,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:05:05,952 INFO L410 AbstractCegarLoop]: === Iteration 37 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:05:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:05,953 INFO L82 PathProgramCache]: Analyzing trace with hash 978187981, now seen corresponding path program 7 times [2019-11-16 00:05:05,953 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:05,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925954849] [2019-11-16 00:05:05,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:05,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:05,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:06,374 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 30 proven. 135 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:05:06,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925954849] [2019-11-16 00:05:06,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998292520] [2019-11-16 00:05:06,375 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:05:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:06,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-16 00:05:06,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 137 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:05:06,887 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:05:06,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2019-11-16 00:05:06,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581953947] [2019-11-16 00:05:06,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-16 00:05:06,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:06,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-16 00:05:06,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:05:06,891 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand 28 states. [2019-11-16 00:05:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:07,693 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2019-11-16 00:05:07,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:05:07,693 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 112 [2019-11-16 00:05:07,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:07,694 INFO L225 Difference]: With dead ends: 141 [2019-11-16 00:05:07,694 INFO L226 Difference]: Without dead ends: 137 [2019-11-16 00:05:07,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=1092, Unknown=0, NotChecked=0, Total=1260 [2019-11-16 00:05:07,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-16 00:05:07,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2019-11-16 00:05:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-16 00:05:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 138 transitions. [2019-11-16 00:05:07,697 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 138 transitions. Word has length 112 [2019-11-16 00:05:07,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:07,697 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 138 transitions. [2019-11-16 00:05:07,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-16 00:05:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2019-11-16 00:05:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-16 00:05:07,698 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:07,698 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:05:07,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:05:07,899 INFO L410 AbstractCegarLoop]: === Iteration 38 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:05:07,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:07,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1820769211, now seen corresponding path program 10 times [2019-11-16 00:05:07,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:07,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562983701] [2019-11-16 00:05:07,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:07,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:07,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 18 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:09,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562983701] [2019-11-16 00:05:09,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331905025] [2019-11-16 00:05:09,153 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:05:09,320 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:05:09,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:05:09,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-16 00:05:09,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:05:09,336 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_29|], 1=[|v_#valid_36|]} [2019-11-16 00:05:09,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:05:09,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-16 00:05:09,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:05:09,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:05:09,359 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:05:09,359 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:05:09,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:05:09,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:05:09,367 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2019-11-16 00:05:09,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-16 00:05:09,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:05:09,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:05:09,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:05:09,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-16 00:05:09,763 INFO L375 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 28 treesize of output 27 [2019-11-16 00:05:09,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:05:09,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:05:09,771 INFO L496 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. [2019-11-16 00:05:09,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-11-16 00:05:10,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 treesize of output 28 [2019-11-16 00:05:10,588 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:05:10,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:05:10,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-16 00:05:10,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:35 [2019-11-16 00:05:10,715 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:05:10,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 10 [2019-11-16 00:05:10,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:05:10,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:05:10,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:05:10,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:42, output treesize:3 [2019-11-16 00:05:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 133 proven. 80 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:05:10,799 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:05:10,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 22] total 52 [2019-11-16 00:05:10,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6755919] [2019-11-16 00:05:10,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-11-16 00:05:10,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:10,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-11-16 00:05:10,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2492, Unknown=0, NotChecked=0, Total=2652 [2019-11-16 00:05:10,801 INFO L87 Difference]: Start difference. First operand 135 states and 138 transitions. Second operand 52 states. [2019-11-16 00:05:14,586 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 40 [2019-11-16 00:05:19,224 WARN L191 SmtUtils]: Spent 4.57 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-11-16 00:05:23,584 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 59 [2019-11-16 00:05:29,949 WARN L191 SmtUtils]: Spent 5.95 s on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-16 00:05:35,619 WARN L191 SmtUtils]: Spent 5.29 s on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-16 00:05:41,259 WARN L191 SmtUtils]: Spent 5.30 s on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-16 00:05:46,939 WARN L191 SmtUtils]: Spent 5.35 s on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-16 00:05:51,459 WARN L191 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-16 00:05:59,644 WARN L191 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-16 00:06:04,216 WARN L191 SmtUtils]: Spent 4.50 s on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-11-16 00:06:09,618 WARN L191 SmtUtils]: Spent 5.21 s on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-11-16 00:06:15,071 WARN L191 SmtUtils]: Spent 5.26 s on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-11-16 00:06:21,162 WARN L191 SmtUtils]: Spent 6.02 s on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-11-16 00:06:21,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:21,595 INFO L93 Difference]: Finished difference Result 303 states and 307 transitions. [2019-11-16 00:06:21,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-16 00:06:21,595 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 121 [2019-11-16 00:06:21,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:21,596 INFO L225 Difference]: With dead ends: 303 [2019-11-16 00:06:21,596 INFO L226 Difference]: Without dead ends: 142 [2019-11-16 00:06:21,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1877 ImplicationChecksByTransitivity, 70.7s TimeCoverageRelationStatistics Valid=825, Invalid=8487, Unknown=0, NotChecked=0, Total=9312 [2019-11-16 00:06:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-16 00:06:21,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2019-11-16 00:06:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-16 00:06:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2019-11-16 00:06:21,601 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 121 [2019-11-16 00:06:21,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:21,601 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2019-11-16 00:06:21,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-11-16 00:06:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2019-11-16 00:06:21,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-16 00:06:21,602 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:21,602 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:21,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:21,803 INFO L410 AbstractCegarLoop]: === Iteration 39 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:06:21,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:21,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1778914242, now seen corresponding path program 11 times [2019-11-16 00:06:21,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:21,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813244657] [2019-11-16 00:06:21,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:21,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:21,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 47 proven. 187 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:06:22,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813244657] [2019-11-16 00:06:22,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370341312] [2019-11-16 00:06:22,116 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:22,344 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-16 00:06:22,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:06:22,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-16 00:06:22,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:22,589 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 45 proven. 189 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:06:22,589 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:22,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 29 [2019-11-16 00:06:22,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205629950] [2019-11-16 00:06:22,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-16 00:06:22,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:22,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-16 00:06:22,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2019-11-16 00:06:22,591 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand 30 states. [2019-11-16 00:06:23,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:23,535 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2019-11-16 00:06:23,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:06:23,536 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 125 [2019-11-16 00:06:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:23,537 INFO L225 Difference]: With dead ends: 157 [2019-11-16 00:06:23,537 INFO L226 Difference]: Without dead ends: 157 [2019-11-16 00:06:23,537 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=1348, Unknown=0, NotChecked=0, Total=1560 [2019-11-16 00:06:23,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-16 00:06:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 151. [2019-11-16 00:06:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-16 00:06:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 157 transitions. [2019-11-16 00:06:23,540 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 157 transitions. Word has length 125 [2019-11-16 00:06:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:23,540 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 157 transitions. [2019-11-16 00:06:23,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-16 00:06:23,541 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 157 transitions. [2019-11-16 00:06:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-16 00:06:23,541 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:23,542 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:23,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:23,746 INFO L410 AbstractCegarLoop]: === Iteration 40 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:06:23,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:23,746 INFO L82 PathProgramCache]: Analyzing trace with hash 688233374, now seen corresponding path program 8 times [2019-11-16 00:06:23,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:23,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42787425] [2019-11-16 00:06:23,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:23,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:23,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 24 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:24,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42787425] [2019-11-16 00:06:24,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005430347] [2019-11-16 00:06:24,815 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:25,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:06:25,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:06:25,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-16 00:06:25,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:25,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-16 00:06:25,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:25,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:25,389 INFO L496 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. [2019-11-16 00:06:25,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-16 00:06:25,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:25,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:06:25,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:25,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:25,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:25,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-16 00:06:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 24 proven. 195 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:06:25,811 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:25,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 24] total 46 [2019-11-16 00:06:25,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389472654] [2019-11-16 00:06:25,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-11-16 00:06:25,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:25,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-16 00:06:25,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1950, Unknown=0, NotChecked=0, Total=2070 [2019-11-16 00:06:25,812 INFO L87 Difference]: Start difference. First operand 151 states and 157 transitions. Second operand 46 states. [2019-11-16 00:06:28,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:28,868 INFO L93 Difference]: Finished difference Result 227 states and 233 transitions. [2019-11-16 00:06:28,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-16 00:06:28,868 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 126 [2019-11-16 00:06:28,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:28,869 INFO L225 Difference]: With dead ends: 227 [2019-11-16 00:06:28,869 INFO L226 Difference]: Without dead ends: 161 [2019-11-16 00:06:28,871 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=340, Invalid=4630, Unknown=0, NotChecked=0, Total=4970 [2019-11-16 00:06:28,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-16 00:06:28,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2019-11-16 00:06:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-16 00:06:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 161 transitions. [2019-11-16 00:06:28,874 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 161 transitions. Word has length 126 [2019-11-16 00:06:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:28,874 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 161 transitions. [2019-11-16 00:06:28,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-11-16 00:06:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 161 transitions. [2019-11-16 00:06:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-16 00:06:28,875 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:28,875 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:29,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:29,076 INFO L410 AbstractCegarLoop]: === Iteration 41 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:06:29,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:29,076 INFO L82 PathProgramCache]: Analyzing trace with hash -934966853, now seen corresponding path program 9 times [2019-11-16 00:06:29,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:29,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008116482] [2019-11-16 00:06:29,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:29,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:29,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:29,466 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 47 proven. 193 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:06:29,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008116482] [2019-11-16 00:06:29,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871525492] [2019-11-16 00:06:29,467 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:29,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-16 00:06:29,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:06:29,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-16 00:06:29,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:29,944 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:29,944 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-16 00:06:29,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:29,963 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:06:29,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:29,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:06:29,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-11-16 00:06:29,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:29,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:29,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:29,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-16 00:06:30,292 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:30,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 50 [2019-11-16 00:06:30,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:30,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:30,322 INFO L496 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. [2019-11-16 00:06:30,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:39 [2019-11-16 00:06:30,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:30,524 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 25 proven. 34 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-11-16 00:06:30,525 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:30,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 29 [2019-11-16 00:06:30,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074051354] [2019-11-16 00:06:30,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-16 00:06:30,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:30,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-16 00:06:30,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2019-11-16 00:06:30,526 INFO L87 Difference]: Start difference. First operand 155 states and 161 transitions. Second operand 30 states. [2019-11-16 00:06:33,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:33,284 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions. [2019-11-16 00:06:33,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-11-16 00:06:33,285 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 130 [2019-11-16 00:06:33,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:33,286 INFO L225 Difference]: With dead ends: 153 [2019-11-16 00:06:33,286 INFO L226 Difference]: Without dead ends: 149 [2019-11-16 00:06:33,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=628, Invalid=4202, Unknown=0, NotChecked=0, Total=4830 [2019-11-16 00:06:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-16 00:06:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-11-16 00:06:33,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-16 00:06:33,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 152 transitions. [2019-11-16 00:06:33,290 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 152 transitions. Word has length 130 [2019-11-16 00:06:33,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:33,291 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 152 transitions. [2019-11-16 00:06:33,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-16 00:06:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 152 transitions. [2019-11-16 00:06:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-16 00:06:33,292 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:33,292 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:33,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:33,493 INFO L410 AbstractCegarLoop]: === Iteration 42 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:06:33,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:33,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1556441971, now seen corresponding path program 12 times [2019-11-16 00:06:33,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:33,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2572403] [2019-11-16 00:06:33,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:33,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:33,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 21 proven. 276 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:06:34,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2572403] [2019-11-16 00:06:34,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556360522] [2019-11-16 00:06:34,007 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:34,481 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-16 00:06:34,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:06:34,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 98 conjunts are in the unsatisfiable core [2019-11-16 00:06:34,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:35,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-16 00:06:35,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:35,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:35,050 INFO L496 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. [2019-11-16 00:06:35,050 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-16 00:06:35,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:35,951 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:06:35,961 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-16 00:06:35,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 21 [2019-11-16 00:06:35,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:35,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:35,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:35,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-11-16 00:06:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 21 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:36,034 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:36,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 33] total 52 [2019-11-16 00:06:36,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981692795] [2019-11-16 00:06:36,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-11-16 00:06:36,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:36,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-11-16 00:06:36,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2530, Unknown=0, NotChecked=0, Total=2652 [2019-11-16 00:06:36,035 INFO L87 Difference]: Start difference. First operand 149 states and 152 transitions. Second operand 52 states. [2019-11-16 00:06:40,632 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-11-16 00:06:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:42,000 INFO L93 Difference]: Finished difference Result 424 states and 428 transitions. [2019-11-16 00:06:42,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-11-16 00:06:42,000 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 139 [2019-11-16 00:06:42,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:42,002 INFO L225 Difference]: With dead ends: 424 [2019-11-16 00:06:42,002 INFO L226 Difference]: Without dead ends: 163 [2019-11-16 00:06:42,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2388 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=665, Invalid=11767, Unknown=0, NotChecked=0, Total=12432 [2019-11-16 00:06:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-16 00:06:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2019-11-16 00:06:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-16 00:06:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2019-11-16 00:06:42,006 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 139 [2019-11-16 00:06:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:42,006 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2019-11-16 00:06:42,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-11-16 00:06:42,006 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2019-11-16 00:06:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-16 00:06:42,007 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:42,007 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:42,213 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:42,213 INFO L410 AbstractCegarLoop]: === Iteration 43 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:06:42,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:42,213 INFO L82 PathProgramCache]: Analyzing trace with hash 482073043, now seen corresponding path program 13 times [2019-11-16 00:06:42,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:42,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745735545] [2019-11-16 00:06:42,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:42,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:42,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 68 proven. 254 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-16 00:06:42,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745735545] [2019-11-16 00:06:42,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969629142] [2019-11-16 00:06:42,658 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:42,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-16 00:06:42,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 66 proven. 256 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-16 00:06:43,286 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:43,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 33 [2019-11-16 00:06:43,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563434855] [2019-11-16 00:06:43,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-16 00:06:43,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:43,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-16 00:06:43,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2019-11-16 00:06:43,287 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand 34 states. [2019-11-16 00:06:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:44,411 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2019-11-16 00:06:44,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:06:44,412 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 147 [2019-11-16 00:06:44,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:44,413 INFO L225 Difference]: With dead ends: 171 [2019-11-16 00:06:44,413 INFO L226 Difference]: Without dead ends: 169 [2019-11-16 00:06:44,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=254, Invalid=1726, Unknown=0, NotChecked=0, Total=1980 [2019-11-16 00:06:44,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-16 00:06:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2019-11-16 00:06:44,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-16 00:06:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 170 transitions. [2019-11-16 00:06:44,416 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 170 transitions. Word has length 147 [2019-11-16 00:06:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:44,417 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 170 transitions. [2019-11-16 00:06:44,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-16 00:06:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 170 transitions. [2019-11-16 00:06:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-16 00:06:44,418 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:44,418 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:44,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:44,623 INFO L410 AbstractCegarLoop]: === Iteration 44 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:06:44,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:44,623 INFO L82 PathProgramCache]: Analyzing trace with hash 699967839, now seen corresponding path program 14 times [2019-11-16 00:06:44,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:44,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010257744] [2019-11-16 00:06:44,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:44,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:44,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 24 proven. 371 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-16 00:06:45,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010257744] [2019-11-16 00:06:45,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594491588] [2019-11-16 00:06:45,402 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:45,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:06:45,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:06:45,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 66 conjunts are in the unsatisfiable core [2019-11-16 00:06:45,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:45,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-16 00:06:45,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:45,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:45,997 INFO L496 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. [2019-11-16 00:06:45,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-16 00:06:46,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:06:46,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:06:46,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:46,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:46,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:46,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-16 00:06:46,966 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 24 proven. 371 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-16 00:06:46,966 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:46,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 48 [2019-11-16 00:06:46,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172061725] [2019-11-16 00:06:46,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-11-16 00:06:46,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:46,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-11-16 00:06:46,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2159, Unknown=0, NotChecked=0, Total=2256 [2019-11-16 00:06:46,968 INFO L87 Difference]: Start difference. First operand 167 states and 170 transitions. Second operand 48 states. [2019-11-16 00:06:54,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:54,090 INFO L93 Difference]: Finished difference Result 476 states and 480 transitions. [2019-11-16 00:06:54,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-11-16 00:06:54,090 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 157 [2019-11-16 00:06:54,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:54,091 INFO L225 Difference]: With dead ends: 476 [2019-11-16 00:06:54,091 INFO L226 Difference]: Without dead ends: 181 [2019-11-16 00:06:54,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 136 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1761 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=606, Invalid=10524, Unknown=0, NotChecked=0, Total=11130 [2019-11-16 00:06:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-16 00:06:54,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 175. [2019-11-16 00:06:54,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-16 00:06:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 178 transitions. [2019-11-16 00:06:54,095 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 178 transitions. Word has length 157 [2019-11-16 00:06:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:54,096 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 178 transitions. [2019-11-16 00:06:54,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-11-16 00:06:54,096 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 178 transitions. [2019-11-16 00:06:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-16 00:06:54,097 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:54,097 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:54,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:54,297 INFO L410 AbstractCegarLoop]: === Iteration 45 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:06:54,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:54,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1199376677, now seen corresponding path program 15 times [2019-11-16 00:06:54,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:54,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025960777] [2019-11-16 00:06:54,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:54,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:54,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 93 proven. 331 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-11-16 00:06:54,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025960777] [2019-11-16 00:06:54,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144836040] [2019-11-16 00:06:54,796 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:55,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-11-16 00:06:55,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:06:55,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-16 00:06:55,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 91 proven. 333 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-11-16 00:06:56,092 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:06:56,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 44 [2019-11-16 00:06:56,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053181206] [2019-11-16 00:06:56,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-16 00:06:56,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:56,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-16 00:06:56,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1707, Unknown=0, NotChecked=0, Total=1980 [2019-11-16 00:06:56,094 INFO L87 Difference]: Start difference. First operand 175 states and 178 transitions. Second operand 45 states. [2019-11-16 00:06:57,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:57,392 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2019-11-16 00:06:57,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-16 00:06:57,392 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 165 [2019-11-16 00:06:57,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:57,394 INFO L225 Difference]: With dead ends: 189 [2019-11-16 00:06:57,394 INFO L226 Difference]: Without dead ends: 187 [2019-11-16 00:06:57,395 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=438, Invalid=2754, Unknown=0, NotChecked=0, Total=3192 [2019-11-16 00:06:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-16 00:06:57,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-11-16 00:06:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-16 00:06:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 188 transitions. [2019-11-16 00:06:57,398 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 188 transitions. Word has length 165 [2019-11-16 00:06:57,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:57,399 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 188 transitions. [2019-11-16 00:06:57,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-16 00:06:57,399 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 188 transitions. [2019-11-16 00:06:57,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-16 00:06:57,399 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:57,399 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:57,600 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:57,600 INFO L410 AbstractCegarLoop]: === Iteration 46 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:06:57,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:57,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1162631729, now seen corresponding path program 16 times [2019-11-16 00:06:57,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:57,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837451441] [2019-11-16 00:06:57,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:57,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:57,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 27 proven. 480 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-11-16 00:06:58,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837451441] [2019-11-16 00:06:58,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108134770] [2019-11-16 00:06:58,420 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:06:58,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:06:58,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:06:58,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-16 00:06:58,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:58,670 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_31|], 1=[|v_#valid_37|]} [2019-11-16 00:06:58,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:06:58,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-16 00:06:58,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:58,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:58,689 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:06:58,689 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:58,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:58,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:58,699 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2019-11-16 00:06:59,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-16 00:06:59,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:59,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:59,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:06:59,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-16 00:06:59,153 INFO L375 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 28 treesize of output 27 [2019-11-16 00:06:59,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:06:59,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:59,161 INFO L496 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. [2019-11-16 00:06:59,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-11-16 00:06:59,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 treesize of output 28 [2019-11-16 00:06:59,975 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:06:59,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:06:59,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-16 00:06:59,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:35 [2019-11-16 00:07:00,069 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:07:00,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 10 [2019-11-16 00:07:00,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:00,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:00,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:00,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:42, output treesize:3 [2019-11-16 00:07:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 331 proven. 176 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-11-16 00:07:00,241 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:00,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 51 [2019-11-16 00:07:00,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272371954] [2019-11-16 00:07:00,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-11-16 00:07:00,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:00,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-11-16 00:07:00,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2368, Unknown=0, NotChecked=0, Total=2550 [2019-11-16 00:07:00,243 INFO L87 Difference]: Start difference. First operand 185 states and 188 transitions. Second operand 51 states. [2019-11-16 00:07:12,077 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 44 [2019-11-16 00:07:16,226 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-16 00:07:20,433 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-11-16 00:07:24,554 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-11-16 00:07:24,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:24,656 INFO L93 Difference]: Finished difference Result 322 states and 326 transitions. [2019-11-16 00:07:24,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-16 00:07:24,656 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 175 [2019-11-16 00:07:24,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:24,658 INFO L225 Difference]: With dead ends: 322 [2019-11-16 00:07:24,658 INFO L226 Difference]: Without dead ends: 192 [2019-11-16 00:07:24,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=469, Invalid=5383, Unknown=0, NotChecked=0, Total=5852 [2019-11-16 00:07:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-16 00:07:24,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2019-11-16 00:07:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-16 00:07:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 192 transitions. [2019-11-16 00:07:24,662 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 192 transitions. Word has length 175 [2019-11-16 00:07:24,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:24,663 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 192 transitions. [2019-11-16 00:07:24,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-11-16 00:07:24,663 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 192 transitions. [2019-11-16 00:07:24,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-16 00:07:24,675 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:24,675 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:24,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:24,879 INFO L410 AbstractCegarLoop]: === Iteration 47 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:07:24,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:24,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1176578676, now seen corresponding path program 17 times [2019-11-16 00:07:24,880 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:24,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968805416] [2019-11-16 00:07:24,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:24,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:24,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 122 proven. 418 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-11-16 00:07:25,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968805416] [2019-11-16 00:07:25,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75260837] [2019-11-16 00:07:25,511 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:26,272 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-11-16 00:07:26,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:07:26,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-16 00:07:26,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:26,748 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 91 proven. 449 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-11-16 00:07:26,748 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:26,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 39 [2019-11-16 00:07:26,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973528972] [2019-11-16 00:07:26,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-16 00:07:26,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:26,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-16 00:07:26,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1367, Unknown=0, NotChecked=0, Total=1560 [2019-11-16 00:07:26,750 INFO L87 Difference]: Start difference. First operand 189 states and 192 transitions. Second operand 40 states. [2019-11-16 00:07:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:28,320 INFO L93 Difference]: Finished difference Result 203 states and 207 transitions. [2019-11-16 00:07:28,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-16 00:07:28,320 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 179 [2019-11-16 00:07:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:28,321 INFO L225 Difference]: With dead ends: 203 [2019-11-16 00:07:28,321 INFO L226 Difference]: Without dead ends: 201 [2019-11-16 00:07:28,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=322, Invalid=2540, Unknown=0, NotChecked=0, Total=2862 [2019-11-16 00:07:28,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-16 00:07:28,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-11-16 00:07:28,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-16 00:07:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 202 transitions. [2019-11-16 00:07:28,326 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 202 transitions. Word has length 179 [2019-11-16 00:07:28,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:28,326 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 202 transitions. [2019-11-16 00:07:28,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-16 00:07:28,327 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 202 transitions. [2019-11-16 00:07:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-16 00:07:28,328 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:28,328 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:28,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:28,534 INFO L410 AbstractCegarLoop]: === Iteration 48 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:07:28,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:28,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1265736512, now seen corresponding path program 18 times [2019-11-16 00:07:28,535 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:28,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937985106] [2019-11-16 00:07:28,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:28,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:28,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:29,061 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 396 proven. 204 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-11-16 00:07:29,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937985106] [2019-11-16 00:07:29,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779229936] [2019-11-16 00:07:29,061 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:29,719 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-11-16 00:07:29,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:07:29,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-16 00:07:29,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:29,752 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:29,753 INFO L375 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-16 00:07:29,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:29,780 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:07:29,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:29,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:07:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 480 proven. 120 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-11-16 00:07:30,665 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:30,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 48 [2019-11-16 00:07:30,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810203989] [2019-11-16 00:07:30,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-11-16 00:07:30,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:30,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-11-16 00:07:30,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1885, Unknown=0, NotChecked=0, Total=2256 [2019-11-16 00:07:30,667 INFO L87 Difference]: Start difference. First operand 199 states and 202 transitions. Second operand 48 states. [2019-11-16 00:07:31,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:31,762 INFO L93 Difference]: Finished difference Result 306 states and 309 transitions. [2019-11-16 00:07:31,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-16 00:07:31,762 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 189 [2019-11-16 00:07:31,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:31,763 INFO L225 Difference]: With dead ends: 306 [2019-11-16 00:07:31,763 INFO L226 Difference]: Without dead ends: 206 [2019-11-16 00:07:31,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=582, Invalid=2958, Unknown=0, NotChecked=0, Total=3540 [2019-11-16 00:07:31,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-16 00:07:31,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2019-11-16 00:07:31,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-16 00:07:31,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 206 transitions. [2019-11-16 00:07:31,768 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 206 transitions. Word has length 189 [2019-11-16 00:07:31,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:31,768 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 206 transitions. [2019-11-16 00:07:31,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-11-16 00:07:31,768 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 206 transitions. [2019-11-16 00:07:31,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-16 00:07:31,769 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:31,769 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:31,969 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:31,970 INFO L410 AbstractCegarLoop]: === Iteration 49 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:07:31,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:31,970 INFO L82 PathProgramCache]: Analyzing trace with hash -307165437, now seen corresponding path program 19 times [2019-11-16 00:07:31,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:31,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901630558] [2019-11-16 00:07:31,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:31,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:31,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 30 proven. 603 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-11-16 00:07:33,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901630558] [2019-11-16 00:07:33,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959001874] [2019-11-16 00:07:33,021 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:33,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 76 conjunts are in the unsatisfiable core [2019-11-16 00:07:33,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:33,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-16 00:07:33,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:33,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:33,728 INFO L496 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. [2019-11-16 00:07:33,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-16 00:07:34,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:35,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:07:35,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:35,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:35,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:35,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-16 00:07:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 30 proven. 603 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-11-16 00:07:35,225 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:35,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 32] total 56 [2019-11-16 00:07:35,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680563534] [2019-11-16 00:07:35,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-11-16 00:07:35,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:35,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-11-16 00:07:35,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-11-16 00:07:35,226 INFO L87 Difference]: Start difference. First operand 203 states and 206 transitions. Second operand 56 states. [2019-11-16 00:07:46,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:46,082 INFO L93 Difference]: Finished difference Result 580 states and 584 transitions. [2019-11-16 00:07:46,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-11-16 00:07:46,082 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 193 [2019-11-16 00:07:46,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:46,083 INFO L225 Difference]: With dead ends: 580 [2019-11-16 00:07:46,084 INFO L226 Difference]: Without dead ends: 217 [2019-11-16 00:07:46,085 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2271 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=682, Invalid=14080, Unknown=0, NotChecked=0, Total=14762 [2019-11-16 00:07:46,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-11-16 00:07:46,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2019-11-16 00:07:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-16 00:07:46,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 214 transitions. [2019-11-16 00:07:46,089 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 214 transitions. Word has length 193 [2019-11-16 00:07:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:46,089 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 214 transitions. [2019-11-16 00:07:46,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-11-16 00:07:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 214 transitions. [2019-11-16 00:07:46,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-16 00:07:46,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:46,091 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:46,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:46,295 INFO L410 AbstractCegarLoop]: === Iteration 50 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:07:46,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:46,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1438038985, now seen corresponding path program 20 times [2019-11-16 00:07:46,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:46,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861563259] [2019-11-16 00:07:46,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:46,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:46,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 155 proven. 515 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:07:46,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861563259] [2019-11-16 00:07:46,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265023016] [2019-11-16 00:07:46,853 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:47,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:07:47,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:07:47,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 65 conjunts are in the unsatisfiable core [2019-11-16 00:07:47,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 153 proven. 517 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:07:47,629 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:47,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 41 [2019-11-16 00:07:47,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983834193] [2019-11-16 00:07:47,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-16 00:07:47,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:47,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-16 00:07:47,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1480, Unknown=0, NotChecked=0, Total=1722 [2019-11-16 00:07:47,630 INFO L87 Difference]: Start difference. First operand 211 states and 214 transitions. Second operand 42 states. [2019-11-16 00:07:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:49,332 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-11-16 00:07:49,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-16 00:07:49,333 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 201 [2019-11-16 00:07:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:49,334 INFO L225 Difference]: With dead ends: 225 [2019-11-16 00:07:49,334 INFO L226 Difference]: Without dead ends: 223 [2019-11-16 00:07:49,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=378, Invalid=2702, Unknown=0, NotChecked=0, Total=3080 [2019-11-16 00:07:49,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-11-16 00:07:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2019-11-16 00:07:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-16 00:07:49,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 224 transitions. [2019-11-16 00:07:49,338 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 224 transitions. Word has length 201 [2019-11-16 00:07:49,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:49,339 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 224 transitions. [2019-11-16 00:07:49,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-16 00:07:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 224 transitions. [2019-11-16 00:07:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-16 00:07:49,340 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:49,340 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:49,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:49,541 INFO L410 AbstractCegarLoop]: === Iteration 51 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:07:49,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:49,541 INFO L82 PathProgramCache]: Analyzing trace with hash 118624213, now seen corresponding path program 21 times [2019-11-16 00:07:49,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:49,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430692679] [2019-11-16 00:07:49,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:49,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:49,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 33 proven. 740 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:07:50,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430692679] [2019-11-16 00:07:50,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835111936] [2019-11-16 00:07:50,367 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:52,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-11-16 00:07:52,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:07:52,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 115 conjunts are in the unsatisfiable core [2019-11-16 00:07:52,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:53,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-16 00:07:53,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:53,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:53,437 INFO L496 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. [2019-11-16 00:07:53,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-11-16 00:07:54,909 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:07:54,942 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:54,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2019-11-16 00:07:54,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:54,954 INFO L567 ElimStorePlain]: treesize reduction 26, result has 27.8 percent of original size [2019-11-16 00:07:54,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:54,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-11-16 00:07:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 33 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:55,093 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:55,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 47] total 74 [2019-11-16 00:07:55,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307835790] [2019-11-16 00:07:55,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-11-16 00:07:55,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:55,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-11-16 00:07:55,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=5224, Unknown=0, NotChecked=0, Total=5402 [2019-11-16 00:07:55,094 INFO L87 Difference]: Start difference. First operand 221 states and 224 transitions. Second operand 74 states. [2019-11-16 00:08:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:06,470 INFO L93 Difference]: Finished difference Result 632 states and 636 transitions. [2019-11-16 00:08:06,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-11-16 00:08:06,470 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 211 [2019-11-16 00:08:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:06,471 INFO L225 Difference]: With dead ends: 632 [2019-11-16 00:08:06,472 INFO L226 Difference]: Without dead ends: 235 [2019-11-16 00:08:06,472 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4397 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=889, Invalid=22673, Unknown=0, NotChecked=0, Total=23562 [2019-11-16 00:08:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-11-16 00:08:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 229. [2019-11-16 00:08:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-11-16 00:08:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 232 transitions. [2019-11-16 00:08:06,477 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 232 transitions. Word has length 211 [2019-11-16 00:08:06,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:06,477 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 232 transitions. [2019-11-16 00:08:06,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-11-16 00:08:06,477 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 232 transitions. [2019-11-16 00:08:06,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-16 00:08:06,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:06,478 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:06,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:06,680 INFO L410 AbstractCegarLoop]: === Iteration 52 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION]=== [2019-11-16 00:08:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:06,680 INFO L82 PathProgramCache]: Analyzing trace with hash -312082661, now seen corresponding path program 22 times [2019-11-16 00:08:06,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:06,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599826868] [2019-11-16 00:08:06,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:06,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:06,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 192 proven. 622 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-11-16 00:08:07,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599826868] [2019-11-16 00:08:07,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535370302] [2019-11-16 00:08:07,356 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:07,628 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:08:07,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:08:07,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-16 00:08:07,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:07,638 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_33|], 1=[|v_#valid_38|]} [2019-11-16 00:08:07,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:07,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-16 00:08:07,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:07,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:07,652 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:08:07,652 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:07,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:07,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:07,658 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-11-16 00:08:07,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-16 00:08:07,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:07,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:07,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:07,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-16 00:08:07,789 INFO L375 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 28 treesize of output 27 [2019-11-16 00:08:07,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:07,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:07,797 INFO L496 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. [2019-11-16 00:08:07,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-11-16 00:08:08,670 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:08,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2019-11-16 00:08:08,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:08:08,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:08,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:08,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:23 [2019-11-16 00:08:08,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 530 proven. 53 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-11-16 00:08:09,054 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:09,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21] total 48 [2019-11-16 00:08:09,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056526754] [2019-11-16 00:08:09,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-11-16 00:08:09,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:09,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-11-16 00:08:09,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2108, Unknown=0, NotChecked=0, Total=2352 [2019-11-16 00:08:09,055 INFO L87 Difference]: Start difference. First operand 229 states and 232 transitions. Second operand 49 states. [2019-11-16 00:08:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:13,450 INFO L93 Difference]: Finished difference Result 228 states and 231 transitions. [2019-11-16 00:08:13,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-16 00:08:13,450 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 219 [2019-11-16 00:08:13,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:13,450 INFO L225 Difference]: With dead ends: 228 [2019-11-16 00:08:13,450 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:08:13,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=727, Invalid=5279, Unknown=0, NotChecked=0, Total=6006 [2019-11-16 00:08:13,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:08:13,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:08:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:08:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:08:13,451 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 219 [2019-11-16 00:08:13,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:13,451 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:08:13,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-11-16 00:08:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:08:13,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:08:13,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:13,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:08:13 BoogieIcfgContainer [2019-11-16 00:08:13,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:08:13,657 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:08:13,657 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:08:13,657 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:08:13,658 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:55" (3/4) ... [2019-11-16 00:08:13,661 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:08:13,667 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-16 00:08:13,667 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-16 00:08:13,668 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-16 00:08:13,668 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-16 00:08:13,668 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-16 00:08:13,668 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-16 00:08:13,668 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncmp [2019-11-16 00:08:13,668 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-16 00:08:13,675 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-16 00:08:13,675 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-16 00:08:13,675 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:08:13,723 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c9d04c40-5ee8-4e44-ab42-34e5e1575889/bin/uautomizer/witness.graphml [2019-11-16 00:08:13,724 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:08:13,725 INFO L168 Benchmark]: Toolchain (without parser) took 259832.83 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 243.3 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -246.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:08:13,725 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:08:13,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 566.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:13,726 INFO L168 Benchmark]: Boogie Preprocessor took 78.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:13,726 INFO L168 Benchmark]: RCFGBuilder took 760.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:13,727 INFO L168 Benchmark]: TraceAbstraction took 258354.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -123.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:08:13,727 INFO L168 Benchmark]: Witness Printer took 67.18 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:08:13,729 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 566.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 760.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 258354.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -123.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 67.18 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: 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: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 525]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 525]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 81 locations, 19 error locations. Result: SAFE, OverallTime: 258.3s, OverallIterations: 52, TraceHistogramMax: 12, AutomataDifference: 198.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2779 SDtfs, 11632 SDslu, 12305 SDs, 0 SdLazy, 79021 SolverSat, 1385 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 54.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5322 GetRequests, 3345 SyntacticMatches, 43 SemanticMatches, 1934 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26698 ImplicationChecksByTransitivity, 169.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 52 MinimizatonAttempts, 238 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 6.3s SatisfiabilityAnalysisTime, 39.3s InterpolantComputationTime, 7838 NumberOfCodeBlocks, 7770 NumberOfCodeBlocksAsserted, 173 NumberOfCheckSat, 7753 ConstructedInterpolants, 825 QuantifiedInterpolants, 12269321 SizeOfPredicates, 309 NumberOfNonLiveVariables, 13476 ConjunctsInSsa, 1446 ConjunctsInUnsatCore, 85 InterpolantComputations, 19 PerfectInterpolantSequences, 7791/20057 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...