./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df3db790fa8159689a8da2e25598b93c123cddf7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df3db790fa8159689a8da2e25598b93c123cddf7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:20:09,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:20:09,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:20:09,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:20:09,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:20:09,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:20:09,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:20:09,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:20:09,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:20:09,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:20:09,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:20:09,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:20:09,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:20:09,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:20:09,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:20:09,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:20:09,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:20:09,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:20:09,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:20:09,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:20:09,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:20:09,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:20:09,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:20:09,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:20:09,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:20:09,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:20:09,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:20:09,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:20:09,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:20:09,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:20:09,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:20:09,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:20:09,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:20:09,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:20:09,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:20:09,994 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:20:09,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:20:09,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:20:09,995 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:20:09,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:20:09,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:20:09,997 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 14:20:10,009 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:20:10,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:20:10,010 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:20:10,010 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:20:10,010 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:20:10,010 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:20:10,010 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:20:10,011 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:20:10,011 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:20:10,011 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:20:10,011 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:20:10,011 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:20:10,011 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:20:10,012 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:20:10,012 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:20:10,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:20:10,012 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:20:10,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:20:10,013 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:20:10,013 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:20:10,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:20:10,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:20:10,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:20:10,014 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 14:20:10,014 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 14:20:10,014 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 14:20:10,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:20:10,014 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:20:10,014 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:20:10,015 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:20:10,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:20:10,015 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:20:10,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:20:10,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:20:10,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:20:10,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:20:10,016 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:20:10,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:20:10,016 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:20:10,016 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:20:10,017 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan 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 -> Taipan 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 -> df3db790fa8159689a8da2e25598b93c123cddf7 [2019-12-07 14:20:10,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:20:10,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:20:10,127 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:20:10,128 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:20:10,128 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:20:10,129 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2019-12-07 14:20:10,164 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/data/631c5419f/ee120e89fc464416805ca0bc074e7a05/FLAG610221a25 [2019-12-07 14:20:10,607 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:20:10,608 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2019-12-07 14:20:10,617 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/data/631c5419f/ee120e89fc464416805ca0bc074e7a05/FLAG610221a25 [2019-12-07 14:20:10,625 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/data/631c5419f/ee120e89fc464416805ca0bc074e7a05 [2019-12-07 14:20:10,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:20:10,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:20:10,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:20:10,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:20:10,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:20:10,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:20:10" (1/1) ... [2019-12-07 14:20:10,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@362cd1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:10, skipping insertion in model container [2019-12-07 14:20:10,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:20:10" (1/1) ... [2019-12-07 14:20:10,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:20:10,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:20:10,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:20:10,876 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:20:10,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:20:10,933 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:20:10,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:10 WrapperNode [2019-12-07 14:20:10,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:20:10,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:20:10,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:20:10,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:20:10,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:10" (1/1) ... [2019-12-07 14:20:10,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:10" (1/1) ... [2019-12-07 14:20:10,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:20:10,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:20:10,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:20:10,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:20:10,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:10" (1/1) ... [2019-12-07 14:20:10,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:10" (1/1) ... [2019-12-07 14:20:10,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:10" (1/1) ... [2019-12-07 14:20:10,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:10" (1/1) ... [2019-12-07 14:20:10,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:10" (1/1) ... [2019-12-07 14:20:10,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:10" (1/1) ... [2019-12-07 14:20:10,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:10" (1/1) ... [2019-12-07 14:20:10,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:20:10,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:20:10,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:20:10,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:20:10,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/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-12-07 14:20:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 14:20:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:20:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:20:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:20:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:20:11,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:20:11,316 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:20:11,316 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 14:20:11,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:20:11 BoogieIcfgContainer [2019-12-07 14:20:11,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:20:11,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:20:11,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:20:11,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:20:11,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:20:10" (1/3) ... [2019-12-07 14:20:11,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68720f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:20:11, skipping insertion in model container [2019-12-07 14:20:11,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:10" (2/3) ... [2019-12-07 14:20:11,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68720f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:20:11, skipping insertion in model container [2019-12-07 14:20:11,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:20:11" (3/3) ... [2019-12-07 14:20:11,321 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca-2.i [2019-12-07 14:20:11,328 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:20:11,332 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-12-07 14:20:11,339 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-12-07 14:20:11,352 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:20:11,352 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 14:20:11,352 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:20:11,352 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:20:11,352 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:20:11,352 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:20:11,352 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:20:11,352 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:20:11,362 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-07 14:20:11,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 14:20:11,366 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:11,367 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 14:20:11,367 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:11,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:11,371 INFO L82 PathProgramCache]: Analyzing trace with hash 155459, now seen corresponding path program 1 times [2019-12-07 14:20:11,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:11,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561802182] [2019-12-07 14:20:11,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:11,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561802182] [2019-12-07 14:20:11,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:11,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:20:11,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223847769] [2019-12-07 14:20:11,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:20:11,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:20:11,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:20:11,501 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-12-07 14:20:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:11,537 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-12-07 14:20:11,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:20:11,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 14:20:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:11,544 INFO L225 Difference]: With dead ends: 33 [2019-12-07 14:20:11,544 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 14:20:11,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:20:11,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 14:20:11,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 14:20:11,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 14:20:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-12-07 14:20:11,567 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 3 [2019-12-07 14:20:11,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:11,567 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-12-07 14:20:11,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:20:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-12-07 14:20:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 14:20:11,567 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:11,567 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 14:20:11,568 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash 155460, now seen corresponding path program 1 times [2019-12-07 14:20:11,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:11,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117381711] [2019-12-07 14:20:11,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:11,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117381711] [2019-12-07 14:20:11,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:11,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:20:11,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598152788] [2019-12-07 14:20:11,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:20:11,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:11,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:20:11,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:20:11,614 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 4 states. [2019-12-07 14:20:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:11,696 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-12-07 14:20:11,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:20:11,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 14:20:11,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:11,698 INFO L225 Difference]: With dead ends: 62 [2019-12-07 14:20:11,698 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 14:20:11,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-12-07 14:20:11,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 14:20:11,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 34. [2019-12-07 14:20:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 14:20:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-12-07 14:20:11,704 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 3 [2019-12-07 14:20:11,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:11,704 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-12-07 14:20:11,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:20:11,704 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-12-07 14:20:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 14:20:11,704 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:11,705 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 14:20:11,705 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:11,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:11,705 INFO L82 PathProgramCache]: Analyzing trace with hash 4915868, now seen corresponding path program 1 times [2019-12-07 14:20:11,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:11,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290489353] [2019-12-07 14:20:11,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:11,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:11,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290489353] [2019-12-07 14:20:11,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:11,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:20:11,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323564753] [2019-12-07 14:20:11,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:20:11,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:11,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:20:11,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:20:11,733 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2019-12-07 14:20:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:11,754 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-12-07 14:20:11,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:20:11,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 14:20:11,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:11,755 INFO L225 Difference]: With dead ends: 32 [2019-12-07 14:20:11,755 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 14:20:11,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:20:11,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 14:20:11,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 14:20:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 14:20:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-12-07 14:20:11,758 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 4 [2019-12-07 14:20:11,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:11,758 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-12-07 14:20:11,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:20:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-12-07 14:20:11,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 14:20:11,758 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:11,758 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 14:20:11,759 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:11,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:11,759 INFO L82 PathProgramCache]: Analyzing trace with hash 4915869, now seen corresponding path program 1 times [2019-12-07 14:20:11,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:11,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143741084] [2019-12-07 14:20:11,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:11,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143741084] [2019-12-07 14:20:11,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:11,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:20:11,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444722849] [2019-12-07 14:20:11,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:20:11,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:11,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:20:11,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:20:11,800 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2019-12-07 14:20:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:11,867 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-12-07 14:20:11,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:20:11,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-12-07 14:20:11,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:11,868 INFO L225 Difference]: With dead ends: 57 [2019-12-07 14:20:11,868 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 14:20:11,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:20:11,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 14:20:11,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2019-12-07 14:20:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 14:20:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-12-07 14:20:11,871 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 4 [2019-12-07 14:20:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:11,871 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-12-07 14:20:11,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:20:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-12-07 14:20:11,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 14:20:11,872 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:11,872 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 14:20:11,872 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:11,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:11,872 INFO L82 PathProgramCache]: Analyzing trace with hash 4918544, now seen corresponding path program 1 times [2019-12-07 14:20:11,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:11,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808575562] [2019-12-07 14:20:11,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:11,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808575562] [2019-12-07 14:20:11,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:11,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:20:11,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684220325] [2019-12-07 14:20:11,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:20:11,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:11,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:20:11,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:20:11,908 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2019-12-07 14:20:11,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:11,929 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-12-07 14:20:11,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:20:11,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 14:20:11,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:11,930 INFO L225 Difference]: With dead ends: 33 [2019-12-07 14:20:11,930 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 14:20:11,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:20:11,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 14:20:11,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-12-07 14:20:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 14:20:11,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-12-07 14:20:11,932 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 4 [2019-12-07 14:20:11,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:11,933 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-12-07 14:20:11,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:20:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-12-07 14:20:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:20:11,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:11,933 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-12-07 14:20:11,933 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:11,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:11,934 INFO L82 PathProgramCache]: Analyzing trace with hash 149486211, now seen corresponding path program 1 times [2019-12-07 14:20:11,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:11,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427636616] [2019-12-07 14:20:11,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:11,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427636616] [2019-12-07 14:20:11,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63866129] [2019-12-07 14:20:11,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/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-12-07 14:20:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:12,014 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 14:20:12,018 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:12,044 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_50|], 1=[|ULTIMATE.start_main_old_#valid|]} [2019-12-07 14:20:12,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:12,058 INFO L377 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-12-07 14:20:12,058 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:12,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:12,073 INFO L377 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-12-07 14:20:12,074 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:12,082 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:12,083 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:12,083 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 14:20:12,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:12,103 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:12,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:20:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:12,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2098646616] [2019-12-07 14:20:12,161 INFO L159 IcfgInterpreter]: Started Sifa with 4 locations of interest [2019-12-07 14:20:12,161 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:20:12,166 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:20:12,170 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:20:12,171 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:20:12,602 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:20:13,087 WARN L192 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-12-07 14:20:13,163 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:20:13,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:20:13,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-12-07 14:20:13,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642201544] [2019-12-07 14:20:13,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:20:13,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:13,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:20:13,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:20:13,165 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 9 states. [2019-12-07 14:20:13,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:13,305 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2019-12-07 14:20:13,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:20:13,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-12-07 14:20:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:13,307 INFO L225 Difference]: With dead ends: 87 [2019-12-07 14:20:13,307 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 14:20:13,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:20:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 14:20:13,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 30. [2019-12-07 14:20:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 14:20:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-12-07 14:20:13,310 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 5 [2019-12-07 14:20:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:13,310 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-12-07 14:20:13,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:20:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-12-07 14:20:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:20:13,311 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:13,311 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:20:13,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:20:13,512 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:13,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:13,513 INFO L82 PathProgramCache]: Analyzing trace with hash 152474858, now seen corresponding path program 1 times [2019-12-07 14:20:13,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:13,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934862916] [2019-12-07 14:20:13,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:13,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934862916] [2019-12-07 14:20:13,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:13,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:20:13,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383815520] [2019-12-07 14:20:13,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:20:13,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:13,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:20:13,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:20:13,568 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 3 states. [2019-12-07 14:20:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:13,588 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-12-07 14:20:13,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:20:13,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 14:20:13,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:13,589 INFO L225 Difference]: With dead ends: 29 [2019-12-07 14:20:13,589 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 14:20:13,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:20:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 14:20:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-12-07 14:20:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 14:20:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-12-07 14:20:13,591 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 5 [2019-12-07 14:20:13,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:13,591 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-12-07 14:20:13,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:20:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-12-07 14:20:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 14:20:13,591 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:13,591 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-07 14:20:13,592 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:13,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:13,592 INFO L82 PathProgramCache]: Analyzing trace with hash 429256203, now seen corresponding path program 1 times [2019-12-07 14:20:13,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:13,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532967030] [2019-12-07 14:20:13,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:13,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532967030] [2019-12-07 14:20:13,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447216301] [2019-12-07 14:20:13,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/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-12-07 14:20:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:13,650 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 14:20:13,651 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:13,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:13,689 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:13,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [81711857] [2019-12-07 14:20:13,731 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2019-12-07 14:20:13,731 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:20:13,732 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:20:13,732 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:20:13,732 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:20:13,860 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:20:13,981 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:20:14,202 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-12-07 14:20:14,349 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:20:14,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:20:14,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2019-12-07 14:20:14,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367399769] [2019-12-07 14:20:14,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:20:14,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:14,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:20:14,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:20:14,350 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 10 states. [2019-12-07 14:20:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:14,489 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2019-12-07 14:20:14,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:20:14,489 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-12-07 14:20:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:14,490 INFO L225 Difference]: With dead ends: 71 [2019-12-07 14:20:14,490 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 14:20:14,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:20:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 14:20:14,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 26. [2019-12-07 14:20:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 14:20:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-12-07 14:20:14,492 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 6 [2019-12-07 14:20:14,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:14,492 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-12-07 14:20:14,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:20:14,492 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-12-07 14:20:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 14:20:14,493 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:14,493 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 14:20:14,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:20:14,694 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:14,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:14,695 INFO L82 PathProgramCache]: Analyzing trace with hash 431754978, now seen corresponding path program 1 times [2019-12-07 14:20:14,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:14,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503497071] [2019-12-07 14:20:14,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:14,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503497071] [2019-12-07 14:20:14,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:14,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:20:14,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549811619] [2019-12-07 14:20:14,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:20:14,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:14,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:20:14,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:20:14,755 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2019-12-07 14:20:14,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:14,795 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-12-07 14:20:14,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:20:14,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-12-07 14:20:14,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:14,796 INFO L225 Difference]: With dead ends: 42 [2019-12-07 14:20:14,796 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 14:20:14,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:20:14,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 14:20:14,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-12-07 14:20:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 14:20:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-12-07 14:20:14,798 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 6 [2019-12-07 14:20:14,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:14,798 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-12-07 14:20:14,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:20:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-12-07 14:20:14,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 14:20:14,799 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:14,799 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 14:20:14,799 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:14,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:14,799 INFO L82 PathProgramCache]: Analyzing trace with hash 431754977, now seen corresponding path program 1 times [2019-12-07 14:20:14,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:14,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361115502] [2019-12-07 14:20:14,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:14,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361115502] [2019-12-07 14:20:14,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:14,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:20:14,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148931385] [2019-12-07 14:20:14,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:20:14,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:14,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:20:14,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:20:14,819 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 4 states. [2019-12-07 14:20:14,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:14,844 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2019-12-07 14:20:14,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:20:14,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 14:20:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:14,845 INFO L225 Difference]: With dead ends: 29 [2019-12-07 14:20:14,845 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 14:20:14,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:20:14,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 14:20:14,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-12-07 14:20:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 14:20:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-12-07 14:20:14,847 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 6 [2019-12-07 14:20:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:14,847 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-12-07 14:20:14,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:20:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2019-12-07 14:20:14,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 14:20:14,847 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:14,847 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:14,847 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:14,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:14,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1013093767, now seen corresponding path program 1 times [2019-12-07 14:20:14,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:14,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505406537] [2019-12-07 14:20:14,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:14,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:14,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505406537] [2019-12-07 14:20:14,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:14,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:20:14,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10364767] [2019-12-07 14:20:14,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:20:14,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:14,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:20:14,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:20:14,863 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 3 states. [2019-12-07 14:20:14,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:14,877 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-12-07 14:20:14,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:20:14,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 14:20:14,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:14,878 INFO L225 Difference]: With dead ends: 27 [2019-12-07 14:20:14,878 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 14:20:14,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:20:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 14:20:14,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-12-07 14:20:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 14:20:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-12-07 14:20:14,880 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 9 [2019-12-07 14:20:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:14,880 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-12-07 14:20:14,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:20:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-12-07 14:20:14,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 14:20:14,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:14,880 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:14,880 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:14,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:14,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1013093766, now seen corresponding path program 1 times [2019-12-07 14:20:14,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:14,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673090526] [2019-12-07 14:20:14,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:14,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673090526] [2019-12-07 14:20:14,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:14,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:20:14,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555089717] [2019-12-07 14:20:14,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:20:14,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:14,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:20:14,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:20:14,907 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 4 states. [2019-12-07 14:20:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:14,939 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-12-07 14:20:14,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:20:14,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 14:20:14,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:14,940 INFO L225 Difference]: With dead ends: 30 [2019-12-07 14:20:14,940 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 14:20:14,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-12-07 14:20:14,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 14:20:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-12-07 14:20:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 14:20:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-12-07 14:20:14,942 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 9 [2019-12-07 14:20:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:14,942 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-12-07 14:20:14,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:20:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-12-07 14:20:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 14:20:14,942 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:14,942 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:14,942 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:14,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:14,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1013084693, now seen corresponding path program 1 times [2019-12-07 14:20:14,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:14,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190777446] [2019-12-07 14:20:14,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:14,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:14,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190777446] [2019-12-07 14:20:14,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:14,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:20:14,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834534793] [2019-12-07 14:20:14,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:20:14,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:14,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:20:14,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:20:14,953 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2019-12-07 14:20:14,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:14,959 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-12-07 14:20:14,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:20:14,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 14:20:14,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:14,960 INFO L225 Difference]: With dead ends: 30 [2019-12-07 14:20:14,960 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 14:20:14,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:20:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 14:20:14,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-07 14:20:14,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 14:20:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-12-07 14:20:14,961 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 9 [2019-12-07 14:20:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:14,962 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-12-07 14:20:14,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:20:14,962 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-12-07 14:20:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:20:14,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:14,962 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:14,962 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:14,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:14,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1374511026, now seen corresponding path program 1 times [2019-12-07 14:20:14,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:14,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238037286] [2019-12-07 14:20:14,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:15,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238037286] [2019-12-07 14:20:15,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:15,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:20:15,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236326477] [2019-12-07 14:20:15,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:20:15,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:15,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:20:15,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:20:15,047 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 7 states. [2019-12-07 14:20:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:15,215 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-12-07 14:20:15,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:20:15,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-12-07 14:20:15,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:15,216 INFO L225 Difference]: With dead ends: 43 [2019-12-07 14:20:15,216 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 14:20:15,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:20:15,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 14:20:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2019-12-07 14:20:15,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 14:20:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-12-07 14:20:15,219 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 11 [2019-12-07 14:20:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:15,219 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-12-07 14:20:15,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:20:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-12-07 14:20:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:20:15,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:15,220 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:15,220 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:15,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:15,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1383175815, now seen corresponding path program 1 times [2019-12-07 14:20:15,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:15,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607495036] [2019-12-07 14:20:15,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:15,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:15,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607495036] [2019-12-07 14:20:15,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:15,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:20:15,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325214758] [2019-12-07 14:20:15,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:20:15,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:15,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:20:15,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:20:15,301 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 4 states. [2019-12-07 14:20:15,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:15,319 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2019-12-07 14:20:15,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:20:15,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 14:20:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:15,320 INFO L225 Difference]: With dead ends: 36 [2019-12-07 14:20:15,320 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 14:20:15,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-12-07 14:20:15,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 14:20:15,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 14:20:15,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 14:20:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-12-07 14:20:15,322 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 11 [2019-12-07 14:20:15,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:15,322 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-12-07 14:20:15,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:20:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-12-07 14:20:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:20:15,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:15,323 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:15,323 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:15,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:15,323 INFO L82 PathProgramCache]: Analyzing trace with hash 14699505, now seen corresponding path program 1 times [2019-12-07 14:20:15,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:15,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77372742] [2019-12-07 14:20:15,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:15,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77372742] [2019-12-07 14:20:15,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297697332] [2019-12-07 14:20:15,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/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-12-07 14:20:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:15,399 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 14:20:15,400 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:15,439 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:15,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:15,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [165420003] [2019-12-07 14:20:15,502 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 14:20:15,503 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:20:15,503 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:20:15,503 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:20:15,503 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:20:15,622 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:20:15,784 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:20:16,440 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-12-07 14:20:16,671 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-12-07 14:20:16,886 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2019-12-07 14:20:17,140 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2019-12-07 14:20:17,422 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 92 [2019-12-07 14:20:17,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:20:17,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6, 6, 6] total 25 [2019-12-07 14:20:17,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357385177] [2019-12-07 14:20:17,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:20:17,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:17,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:20:17,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2019-12-07 14:20:17,424 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 12 states. [2019-12-07 14:20:17,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:17,504 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-12-07 14:20:17,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:20:17,504 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-12-07 14:20:17,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:17,505 INFO L225 Difference]: With dead ends: 35 [2019-12-07 14:20:17,505 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 14:20:17,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2019-12-07 14:20:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 14:20:17,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-12-07 14:20:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 14:20:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-12-07 14:20:17,507 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 13 [2019-12-07 14:20:17,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:17,507 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-12-07 14:20:17,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:20:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-12-07 14:20:17,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 14:20:17,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:17,508 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:17,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:20:17,709 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:17,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:17,710 INFO L82 PathProgramCache]: Analyzing trace with hash 641611011, now seen corresponding path program 1 times [2019-12-07 14:20:17,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:17,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650694030] [2019-12-07 14:20:17,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:20:17,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650694030] [2019-12-07 14:20:17,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325453341] [2019-12-07 14:20:17,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/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-12-07 14:20:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:17,802 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 14:20:17,803 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:20:17,879 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:20:17,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2055592666] [2019-12-07 14:20:17,946 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 14:20:17,946 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:20:17,946 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:20:17,947 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:20:17,947 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:20:18,016 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:20:18,285 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:20:19,251 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-12-07 14:20:19,440 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-12-07 14:20:19,641 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-12-07 14:20:20,052 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 14:20:20,052 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:20:20,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:20:20,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-12-07 14:20:20,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704255066] [2019-12-07 14:20:20,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 14:20:20,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:20,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 14:20:20,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2019-12-07 14:20:20,054 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 17 states. [2019-12-07 14:20:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:20,261 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-12-07 14:20:20,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:20:20,261 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2019-12-07 14:20:20,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:20,262 INFO L225 Difference]: With dead ends: 35 [2019-12-07 14:20:20,262 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 14:20:20,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 14:20:20,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 14:20:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2019-12-07 14:20:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 14:20:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-12-07 14:20:20,264 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 15 [2019-12-07 14:20:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:20,264 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-12-07 14:20:20,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 14:20:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-12-07 14:20:20,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:20:20,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:20,264 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:20,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:20:20,466 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:20,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:20,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1630569657, now seen corresponding path program 1 times [2019-12-07 14:20:20,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:20,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625890044] [2019-12-07 14:20:20,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:20:20,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625890044] [2019-12-07 14:20:20,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610125660] [2019-12-07 14:20:20,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/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-12-07 14:20:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:20,559 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 14:20:20,560 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:20:20,586 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:20:20,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1224982903] [2019-12-07 14:20:20,636 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 14:20:20,636 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:20:20,637 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:20:20,637 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:20:20,637 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:20:20,867 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:20:20,913 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:20:21,080 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:20:21,248 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-12-07 14:20:21,859 WARN L192 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-12-07 14:20:22,449 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-12-07 14:20:22,793 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-12-07 14:20:23,002 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-12-07 14:20:23,235 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-12-07 14:20:23,533 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 14:20:23,534 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:20:23,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:20:23,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2019-12-07 14:20:23,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445703084] [2019-12-07 14:20:23,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 14:20:23,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:23,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 14:20:23,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2019-12-07 14:20:23,536 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 14 states. [2019-12-07 14:20:23,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:23,818 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-12-07 14:20:23,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:20:23,818 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-12-07 14:20:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:23,819 INFO L225 Difference]: With dead ends: 35 [2019-12-07 14:20:23,819 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 14:20:23,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2019-12-07 14:20:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 14:20:23,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-12-07 14:20:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 14:20:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-12-07 14:20:23,822 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 18 [2019-12-07 14:20:23,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:23,822 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-12-07 14:20:23,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 14:20:23,822 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-12-07 14:20:23,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:20:23,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:23,823 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:24,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:20:24,024 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:24,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:24,025 INFO L82 PathProgramCache]: Analyzing trace with hash -685578703, now seen corresponding path program 2 times [2019-12-07 14:20:24,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:20:24,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783021062] [2019-12-07 14:20:24,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:20:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:20:24,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783021062] [2019-12-07 14:20:24,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372364118] [2019-12-07 14:20:24,220 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/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-12-07 14:20:24,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 14:20:24,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:20:24,259 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-07 14:20:24,260 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:20:24,492 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:24,613 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2019-12-07 14:20:24,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1459059455] [2019-12-07 14:20:24,614 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 14:20:24,614 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:20:24,615 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:20:24,615 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:20:24,615 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:20:24,621 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5e390c54 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:555) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:20:24,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:20:24,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-12-07 14:20:24,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921614790] [2019-12-07 14:20:24,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:20:24,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:20:24,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:20:24,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2019-12-07 14:20:24,624 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 10 states. [2019-12-07 14:20:24,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 14:20:24,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:20:24,825 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5e390c54 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:20:24,832 INFO L168 Benchmark]: Toolchain (without parser) took 14203.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 265.8 MB). Free memory was 937.3 MB in the beginning and 802.3 MB in the end (delta: 135.0 MB). Peak memory consumption was 400.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:20:24,832 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:20:24,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.9 MB). Free memory was 937.3 MB in the beginning and 1.1 GB in the end (delta: -131.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:20:24,833 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:20:24,833 INFO L168 Benchmark]: Boogie Preprocessor took 18.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:20:24,833 INFO L168 Benchmark]: RCFGBuilder took 334.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:20:24,833 INFO L168 Benchmark]: TraceAbstraction took 13512.28 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.0 GB in the beginning and 802.3 MB in the end (delta: 216.2 MB). Peak memory consumption was 397.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:20:24,835 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.9 MB). Free memory was 937.3 MB in the beginning and 1.1 GB in the end (delta: -131.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 334.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13512.28 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.0 GB in the beginning and 802.3 MB in the end (delta: 216.2 MB). Peak memory consumption was 397.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5e390c54 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5e390c54: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 14:20:26,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:20:26,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:20:26,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:20:26,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:20:26,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:20:26,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:20:26,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:20:26,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:20:26,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:20:26,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:20:26,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:20:26,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:20:26,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:20:26,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:20:26,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:20:26,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:20:26,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:20:26,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:20:26,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:20:26,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:20:26,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:20:26,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:20:26,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:20:26,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:20:26,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:20:26,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:20:26,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:20:26,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:20:26,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:20:26,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:20:26,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:20:26,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:20:26,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:20:26,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:20:26,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:20:26,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:20:26,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:20:26,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:20:26,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:20:26,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:20:26,287 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 14:20:26,299 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:20:26,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:20:26,300 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:20:26,301 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:20:26,301 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:20:26,301 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:20:26,301 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:20:26,301 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:20:26,301 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:20:26,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:20:26,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:20:26,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:20:26,303 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:20:26,303 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:20:26,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:20:26,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:20:26,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:20:26,304 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 14:20:26,304 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 14:20:26,304 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 14:20:26,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:20:26,304 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:20:26,305 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 14:20:26,305 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 14:20:26,305 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:20:26,305 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:20:26,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:20:26,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:20:26,306 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:20:26,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:20:26,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:20:26,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:20:26,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:20:26,307 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 14:20:26,307 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 14:20:26,307 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:20:26,307 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:20:26,308 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan 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 -> Taipan 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 -> df3db790fa8159689a8da2e25598b93c123cddf7 [2019-12-07 14:20:26,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:20:26,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:20:26,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:20:26,489 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:20:26,490 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:20:26,490 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2019-12-07 14:20:26,529 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/data/122c7ed1d/6941cdd598b3494a9a8dd82378d857c4/FLAG025eeb776 [2019-12-07 14:20:26,895 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:20:26,895 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2019-12-07 14:20:26,904 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/data/122c7ed1d/6941cdd598b3494a9a8dd82378d857c4/FLAG025eeb776 [2019-12-07 14:20:26,912 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/data/122c7ed1d/6941cdd598b3494a9a8dd82378d857c4 [2019-12-07 14:20:26,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:20:26,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:20:26,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:20:26,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:20:26,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:20:26,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:20:26" (1/1) ... [2019-12-07 14:20:26,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5f40e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:26, skipping insertion in model container [2019-12-07 14:20:26,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:20:26" (1/1) ... [2019-12-07 14:20:26,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:20:26,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:20:27,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:20:27,169 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:20:27,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:20:27,232 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:20:27,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:27 WrapperNode [2019-12-07 14:20:27,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:20:27,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:20:27,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:20:27,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:20:27,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:27" (1/1) ... [2019-12-07 14:20:27,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:27" (1/1) ... [2019-12-07 14:20:27,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:20:27,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:20:27,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:20:27,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:20:27,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:27" (1/1) ... [2019-12-07 14:20:27,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:27" (1/1) ... [2019-12-07 14:20:27,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:27" (1/1) ... [2019-12-07 14:20:27,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:27" (1/1) ... [2019-12-07 14:20:27,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:27" (1/1) ... [2019-12-07 14:20:27,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:27" (1/1) ... [2019-12-07 14:20:27,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:27" (1/1) ... [2019-12-07 14:20:27,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:20:27,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:20:27,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:20:27,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:20:27,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/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-12-07 14:20:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-12-07 14:20:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:20:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-12-07 14:20:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:20:27,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:20:27,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:20:27,610 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:20:27,610 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 14:20:27,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:20:27 BoogieIcfgContainer [2019-12-07 14:20:27,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:20:27,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:20:27,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:20:27,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:20:27,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:20:26" (1/3) ... [2019-12-07 14:20:27,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aec209f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:20:27, skipping insertion in model container [2019-12-07 14:20:27,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:20:27" (2/3) ... [2019-12-07 14:20:27,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aec209f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:20:27, skipping insertion in model container [2019-12-07 14:20:27,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:20:27" (3/3) ... [2019-12-07 14:20:27,616 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca-2.i [2019-12-07 14:20:27,622 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:20:27,627 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-12-07 14:20:27,634 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-12-07 14:20:27,647 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:20:27,647 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 14:20:27,647 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:20:27,647 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:20:27,647 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:20:27,647 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:20:27,647 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:20:27,647 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:20:27,657 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-12-07 14:20:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 14:20:27,662 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:27,662 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:27,662 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:27,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:27,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1805029096, now seen corresponding path program 1 times [2019-12-07 14:20:27,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:20:27,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760377978] [2019-12-07 14:20:27,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 14:20:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:27,720 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:20:27,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:27,755 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:27,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760377978] [2019-12-07 14:20:27,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:27,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:20:27,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952843861] [2019-12-07 14:20:27,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:20:27,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:20:27,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:20:27,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:20:27,796 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 6 states. [2019-12-07 14:20:27,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:27,890 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2019-12-07 14:20:27,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:20:27,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 14:20:27,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:27,900 INFO L225 Difference]: With dead ends: 98 [2019-12-07 14:20:27,900 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 14:20:27,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:20:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 14:20:27,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2019-12-07 14:20:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 14:20:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2019-12-07 14:20:27,927 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 7 [2019-12-07 14:20:27,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:27,927 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2019-12-07 14:20:27,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:20:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2019-12-07 14:20:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 14:20:27,927 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:27,927 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:28,128 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 14:20:28,129 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:28,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876138, now seen corresponding path program 1 times [2019-12-07 14:20:28,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:20:28,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486424177] [2019-12-07 14:20:28,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 14:20:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:28,205 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:20:28,206 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:28,252 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:20:28,252 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 14:20:28,253 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:28,260 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:28,261 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:20:28,261 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-12-07 14:20:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:28,275 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:28,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:28,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486424177] [2019-12-07 14:20:28,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:28,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 14:20:28,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496935835] [2019-12-07 14:20:28,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:20:28,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:20:28,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:20:28,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:20:28,287 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 4 states. [2019-12-07 14:20:28,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:28,362 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-12-07 14:20:28,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:20:28,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 14:20:28,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:28,364 INFO L225 Difference]: With dead ends: 52 [2019-12-07 14:20:28,364 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 14:20:28,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:20:28,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 14:20:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-07 14:20:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 14:20:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-12-07 14:20:28,368 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 7 [2019-12-07 14:20:28,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:28,369 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-12-07 14:20:28,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:20:28,369 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-12-07 14:20:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 14:20:28,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:28,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:28,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 14:20:28,571 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:28,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:28,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2019-12-07 14:20:28,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:20:28,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512781713] [2019-12-07 14:20:28,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 14:20:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:28,670 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:20:28,670 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:28,681 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_33|]} [2019-12-07 14:20:28,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:28,689 INFO L377 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-12-07 14:20:28,689 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:28,712 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:28,720 INFO L377 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-12-07 14:20:28,721 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:28,740 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:28,741 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:28,741 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:28, output treesize:13 [2019-12-07 14:20:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:28,761 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:28,860 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:20:28,868 INFO L377 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-12-07 14:20:28,868 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:28,878 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:28,880 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:20:28,881 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:28,891 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:28,891 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:28,892 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-12-07 14:20:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:28,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512781713] [2019-12-07 14:20:28,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:28,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 14:20:28,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640813839] [2019-12-07 14:20:28,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:20:28,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:20:28,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:20:28,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:20:28,911 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 6 states. [2019-12-07 14:20:29,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:29,356 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2019-12-07 14:20:29,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:20:29,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 14:20:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:29,359 INFO L225 Difference]: With dead ends: 95 [2019-12-07 14:20:29,359 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 14:20:29,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:20:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 14:20:29,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 54. [2019-12-07 14:20:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 14:20:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2019-12-07 14:20:29,364 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 7 [2019-12-07 14:20:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:29,364 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2019-12-07 14:20:29,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:20:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2019-12-07 14:20:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 14:20:29,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:29,365 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:29,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 14:20:29,566 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:29,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:29,568 INFO L82 PathProgramCache]: Analyzing trace with hash -533876960, now seen corresponding path program 1 times [2019-12-07 14:20:29,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:20:29,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17757388] [2019-12-07 14:20:29,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 14:20:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:29,603 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:20:29,604 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:29,612 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_26|], 1=[|v_#valid_35|]} [2019-12-07 14:20:29,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:29,617 INFO L377 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-12-07 14:20:29,617 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:29,629 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:29,634 INFO L377 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-12-07 14:20:29,635 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:29,654 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:29,655 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:29,655 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 14:20:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:29,665 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:29,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:20:29,746 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:20:29,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:29,754 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:29,757 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:29,758 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 14:20:29,758 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:29,758 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:5 [2019-12-07 14:20:29,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:29,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17757388] [2019-12-07 14:20:29,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:29,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 14:20:29,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499688287] [2019-12-07 14:20:29,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:20:29,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:20:29,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:20:29,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:20:29,780 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 6 states. [2019-12-07 14:20:30,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:30,137 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2019-12-07 14:20:30,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:20:30,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 14:20:30,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:30,139 INFO L225 Difference]: With dead ends: 91 [2019-12-07 14:20:30,139 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 14:20:30,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:20:30,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 14:20:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 53. [2019-12-07 14:20:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 14:20:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-12-07 14:20:30,144 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 9 [2019-12-07 14:20:30,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:30,144 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-12-07 14:20:30,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:20:30,144 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-12-07 14:20:30,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 14:20:30,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:30,144 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:30,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 14:20:30,346 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:30,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:30,347 INFO L82 PathProgramCache]: Analyzing trace with hash -533876908, now seen corresponding path program 1 times [2019-12-07 14:20:30,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:20:30,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277355130] [2019-12-07 14:20:30,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 14:20:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:30,427 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:20:30,428 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:30,439 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:30,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277355130] [2019-12-07 14:20:30,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:30,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:20:30,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779806351] [2019-12-07 14:20:30,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:20:30,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:20:30,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:20:30,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:20:30,459 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 6 states. [2019-12-07 14:20:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:30,526 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2019-12-07 14:20:30,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:20:30,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 14:20:30,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:30,528 INFO L225 Difference]: With dead ends: 96 [2019-12-07 14:20:30,528 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 14:20:30,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:20:30,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 14:20:30,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 64. [2019-12-07 14:20:30,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 14:20:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-12-07 14:20:30,532 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 9 [2019-12-07 14:20:30,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:30,532 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-12-07 14:20:30,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:20:30,533 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-12-07 14:20:30,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 14:20:30,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:30,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:30,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 14:20:30,735 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:30,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:30,736 INFO L82 PathProgramCache]: Analyzing trace with hash -476618606, now seen corresponding path program 1 times [2019-12-07 14:20:30,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:20:30,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687158587] [2019-12-07 14:20:30,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 14:20:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:30,809 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:20:30,810 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:30,826 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:20:30,827 INFO L377 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 11 [2019-12-07 14:20:30,827 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:30,831 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:30,832 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:20:30,832 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 14:20:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:30,844 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:30,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687158587] [2019-12-07 14:20:30,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:30,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 14:20:30,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926296884] [2019-12-07 14:20:30,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:20:30,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:20:30,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:20:30,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:20:30,850 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 3 states. [2019-12-07 14:20:30,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:30,913 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-12-07 14:20:30,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:20:30,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 14:20:30,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:30,914 INFO L225 Difference]: With dead ends: 62 [2019-12-07 14:20:30,914 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 14:20:30,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:20:30,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 14:20:30,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 14:20:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 14:20:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2019-12-07 14:20:30,919 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 9 [2019-12-07 14:20:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:30,920 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-12-07 14:20:30,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:20:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2019-12-07 14:20:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 14:20:30,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:30,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:31,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 14:20:31,122 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:31,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:31,123 INFO L82 PathProgramCache]: Analyzing trace with hash -476618605, now seen corresponding path program 1 times [2019-12-07 14:20:31,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:20:31,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617263356] [2019-12-07 14:20:31,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 14:20:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:31,191 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:20:31,192 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:31,221 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:31,221 INFO L377 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-12-07 14:20:31,222 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:31,254 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 14:20:31,255 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:31,255 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2019-12-07 14:20:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:31,283 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:31,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617263356] [2019-12-07 14:20:31,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:31,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 14:20:31,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196588353] [2019-12-07 14:20:31,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:20:31,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:20:31,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:20:31,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:20:31,410 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 8 states. [2019-12-07 14:20:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:31,775 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2019-12-07 14:20:31,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:20:31,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-12-07 14:20:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:31,777 INFO L225 Difference]: With dead ends: 96 [2019-12-07 14:20:31,777 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 14:20:31,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:20:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 14:20:31,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 64. [2019-12-07 14:20:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 14:20:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2019-12-07 14:20:31,781 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 9 [2019-12-07 14:20:31,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:31,781 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2019-12-07 14:20:31,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:20:31,781 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2019-12-07 14:20:31,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 14:20:31,782 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:31,782 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:31,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 14:20:31,984 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:31,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:31,985 INFO L82 PathProgramCache]: Analyzing trace with hash 629683418, now seen corresponding path program 1 times [2019-12-07 14:20:31,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:20:31,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777336841] [2019-12-07 14:20:31,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 14:20:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:32,022 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:20:32,023 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:32,045 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:32,045 INFO L377 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-12-07 14:20:32,046 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:32,072 INFO L614 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-12-07 14:20:32,072 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:32,072 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2019-12-07 14:20:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:32,081 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:32,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777336841] [2019-12-07 14:20:32,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:32,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 14:20:32,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804648042] [2019-12-07 14:20:32,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:20:32,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:20:32,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:20:32,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:20:32,186 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 6 states. [2019-12-07 14:20:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:32,430 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2019-12-07 14:20:32,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:20:32,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 14:20:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:32,432 INFO L225 Difference]: With dead ends: 93 [2019-12-07 14:20:32,432 INFO L226 Difference]: Without dead ends: 93 [2019-12-07 14:20:32,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:20:32,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-07 14:20:32,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2019-12-07 14:20:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 14:20:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-12-07 14:20:32,436 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 10 [2019-12-07 14:20:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:32,436 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-12-07 14:20:32,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:20:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-12-07 14:20:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:20:32,437 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:32,437 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:32,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 14:20:32,639 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:32,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:32,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2019-12-07 14:20:32,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:20:32,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64319471] [2019-12-07 14:20:32,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 14:20:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:32,716 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 14:20:32,717 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:32,725 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_34|], 1=[|v_#valid_42|]} [2019-12-07 14:20:32,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:32,730 INFO L377 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-12-07 14:20:32,730 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:32,748 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:32,753 INFO L377 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-12-07 14:20:32,754 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:32,768 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:32,769 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:32,769 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 14:20:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:32,905 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:33,330 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:20:33,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:33,334 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:33,335 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:33,335 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 14:20:33,335 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:33,335 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:1 [2019-12-07 14:20:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:33,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64319471] [2019-12-07 14:20:33,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1072555002] [2019-12-07 14:20:33,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:20:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:33,396 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 14:20:33,397 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:33,401 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_36|], 1=[|v_#valid_44|]} [2019-12-07 14:20:33,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:33,407 INFO L377 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-12-07 14:20:33,407 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:33,423 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:33,429 INFO L377 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-12-07 14:20:33,429 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:33,447 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:33,448 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:33,448 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 14:20:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:33,555 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:33,991 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:20:33,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:33,996 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:33,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:33,997 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 14:20:33,997 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:33,997 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-12-07 14:20:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:33,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233719206] [2019-12-07 14:20:33,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/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-12-07 14:20:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:34,063 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:20:34,064 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:34,068 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_38|], 1=[|v_#valid_46|]} [2019-12-07 14:20:34,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:20:34,073 INFO L377 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-12-07 14:20:34,073 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:34,084 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:34,089 INFO L377 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-12-07 14:20:34,089 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:34,100 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:34,100 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:34,100 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 14:20:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:34,280 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:34,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:20:34,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 4, 5] total 18 [2019-12-07 14:20:34,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796272381] [2019-12-07 14:20:34,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 14:20:34,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:20:34,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 14:20:34,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:20:34,297 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 19 states. [2019-12-07 14:20:34,932 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 14:20:35,163 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-12-07 14:20:35,754 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-12-07 14:20:36,426 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-12-07 14:20:37,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:37,033 INFO L93 Difference]: Finished difference Result 243 states and 277 transitions. [2019-12-07 14:20:37,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:20:37,035 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 11 [2019-12-07 14:20:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:37,036 INFO L225 Difference]: With dead ends: 243 [2019-12-07 14:20:37,036 INFO L226 Difference]: Without dead ends: 243 [2019-12-07 14:20:37,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2019-12-07 14:20:37,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-12-07 14:20:37,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 87. [2019-12-07 14:20:37,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 14:20:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2019-12-07 14:20:37,040 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 11 [2019-12-07 14:20:37,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:37,041 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2019-12-07 14:20:37,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 14:20:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2019-12-07 14:20:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 14:20:37,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:37,041 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:37,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:20:37,645 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:37,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:37,646 INFO L82 PathProgramCache]: Analyzing trace with hash -464624129, now seen corresponding path program 1 times [2019-12-07 14:20:37,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:20:37,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269589629] [2019-12-07 14:20:37,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 14:20:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:37,723 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:20:37,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:37,760 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:37,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:20:37,848 INFO L377 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 16 treesize of output 12 [2019-12-07 14:20:37,848 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:20:37,857 INFO L377 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 8 treesize of output 6 [2019-12-07 14:20:37,858 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:20:37,884 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:37,885 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 14:20:37,885 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2019-12-07 14:20:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:38,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269589629] [2019-12-07 14:20:38,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:38,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 14:20:38,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433579724] [2019-12-07 14:20:38,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:20:38,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:20:38,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:20:38,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:20:38,007 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand 10 states. [2019-12-07 14:20:38,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:38,757 INFO L93 Difference]: Finished difference Result 168 states and 194 transitions. [2019-12-07 14:20:38,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:20:38,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-12-07 14:20:38,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:38,760 INFO L225 Difference]: With dead ends: 168 [2019-12-07 14:20:38,760 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 14:20:38,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:20:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 14:20:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 86. [2019-12-07 14:20:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 14:20:38,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2019-12-07 14:20:38,764 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 12 [2019-12-07 14:20:38,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:38,764 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2019-12-07 14:20:38,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:20:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2019-12-07 14:20:38,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 14:20:38,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:38,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:38,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 14:20:38,966 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:38,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:38,967 INFO L82 PathProgramCache]: Analyzing trace with hash -464624130, now seen corresponding path program 1 times [2019-12-07 14:20:38,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:20:38,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227255908] [2019-12-07 14:20:38,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 14:20:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:39,080 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:20:39,081 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:39,090 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:39,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227255908] [2019-12-07 14:20:39,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:39,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 14:20:39,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480881602] [2019-12-07 14:20:39,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:20:39,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:20:39,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:20:39,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:20:39,099 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 4 states. [2019-12-07 14:20:39,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:39,170 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2019-12-07 14:20:39,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:20:39,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 14:20:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:39,172 INFO L225 Difference]: With dead ends: 83 [2019-12-07 14:20:39,172 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 14:20:39,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:20:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 14:20:39,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-12-07 14:20:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 14:20:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-12-07 14:20:39,175 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 12 [2019-12-07 14:20:39,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:39,175 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-12-07 14:20:39,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:20:39,175 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-12-07 14:20:39,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:20:39,176 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:39,176 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:39,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 14:20:39,378 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:39,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:39,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1862804906, now seen corresponding path program 1 times [2019-12-07 14:20:39,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:20:39,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985496508] [2019-12-07 14:20:39,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 14:20:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:39,446 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:20:39,447 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:39,467 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:39,467 INFO L377 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-12-07 14:20:39,468 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:39,496 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 14:20:39,496 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:39,496 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 14:20:39,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:39,580 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:39,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985496508] [2019-12-07 14:20:39,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1292008693] [2019-12-07 14:20:39,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:20:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:40,027 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:20:40,027 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:40,048 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:40,048 INFO L377 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-12-07 14:20:40,048 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:40,082 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 14:20:40,082 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:40,083 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 14:20:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:40,085 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:40,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030662967] [2019-12-07 14:20:40,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/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-12-07 14:20:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:40,124 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:20:40,125 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:40,141 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:40,141 INFO L377 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-12-07 14:20:40,142 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:40,172 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 14:20:40,172 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:40,172 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 14:20:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:40,258 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:40,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:20:40,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6, 5, 6, 6] total 16 [2019-12-07 14:20:40,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599411431] [2019-12-07 14:20:40,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 14:20:40,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:20:40,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 14:20:40,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:20:40,976 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 17 states. [2019-12-07 14:20:41,887 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-12-07 14:20:42,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:42,281 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2019-12-07 14:20:42,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:20:42,282 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-12-07 14:20:42,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:42,283 INFO L225 Difference]: With dead ends: 138 [2019-12-07 14:20:42,283 INFO L226 Difference]: Without dead ends: 138 [2019-12-07 14:20:42,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:20:42,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-07 14:20:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 80. [2019-12-07 14:20:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 14:20:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2019-12-07 14:20:42,285 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 13 [2019-12-07 14:20:42,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:42,285 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2019-12-07 14:20:42,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 14:20:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2019-12-07 14:20:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:20:42,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:42,286 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:42,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3,16 cvc4 --incremental --print-success --lang smt --rewrite-divk,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:20:42,888 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:42,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:42,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1432374396, now seen corresponding path program 1 times [2019-12-07 14:20:42,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:20:42,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841019335] [2019-12-07 14:20:42,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 14:20:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:42,945 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:20:42,946 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:42,958 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 14:20:42,958 INFO L377 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 11 [2019-12-07 14:20:42,958 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:42,962 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:42,962 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:20:42,962 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 14:20:42,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:42,973 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:42,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841019335] [2019-12-07 14:20:42,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:42,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 14:20:42,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10251166] [2019-12-07 14:20:42,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:20:42,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:20:42,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:20:42,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:20:42,978 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand 4 states. [2019-12-07 14:20:43,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:43,045 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2019-12-07 14:20:43,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:20:43,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 14:20:43,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:43,045 INFO L225 Difference]: With dead ends: 78 [2019-12-07 14:20:43,046 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 14:20:43,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:20:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 14:20:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-12-07 14:20:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 14:20:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2019-12-07 14:20:43,047 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 16 [2019-12-07 14:20:43,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:43,047 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2019-12-07 14:20:43,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:20:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2019-12-07 14:20:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:20:43,048 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:43,048 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:43,249 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 14:20:43,249 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:43,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:43,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1432374395, now seen corresponding path program 1 times [2019-12-07 14:20:43,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:20:43,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381660471] [2019-12-07 14:20:43,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 14:20:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:43,342 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:20:43,343 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:43,359 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:43,359 INFO L377 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-12-07 14:20:43,359 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:43,378 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 14:20:43,378 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:43,378 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 14:20:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:43,392 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:43,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381660471] [2019-12-07 14:20:43,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:43,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 14:20:43,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940830] [2019-12-07 14:20:43,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:20:43,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:20:43,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:20:43,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:20:43,475 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand 8 states. [2019-12-07 14:20:43,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:43,853 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2019-12-07 14:20:43,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:20:43,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 14:20:43,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:43,854 INFO L225 Difference]: With dead ends: 129 [2019-12-07 14:20:43,854 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 14:20:43,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:20:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 14:20:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 86. [2019-12-07 14:20:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 14:20:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2019-12-07 14:20:43,857 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 16 [2019-12-07 14:20:43,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:43,857 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2019-12-07 14:20:43,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:20:43,857 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2019-12-07 14:20:43,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:20:43,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:43,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:44,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 14:20:44,059 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:44,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:44,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1432365322, now seen corresponding path program 1 times [2019-12-07 14:20:44,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:20:44,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006358055] [2019-12-07 14:20:44,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 14:20:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:44,156 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:20:44,157 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:44,160 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:44,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:44,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006358055] [2019-12-07 14:20:44,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:44,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 14:20:44,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085102505] [2019-12-07 14:20:44,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:20:44,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:20:44,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:20:44,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:20:44,162 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 3 states. [2019-12-07 14:20:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:20:44,170 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2019-12-07 14:20:44,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:20:44,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 14:20:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:20:44,171 INFO L225 Difference]: With dead ends: 87 [2019-12-07 14:20:44,171 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 14:20:44,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:20:44,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 14:20:44,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-12-07 14:20:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 14:20:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2019-12-07 14:20:44,173 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 16 [2019-12-07 14:20:44,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:20:44,173 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2019-12-07 14:20:44,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:20:44,174 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2019-12-07 14:20:44,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:20:44,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:20:44,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:20:44,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 14:20:44,375 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 14:20:44,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:20:44,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1365500555, now seen corresponding path program 1 times [2019-12-07 14:20:44,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:20:44,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194769484] [2019-12-07 14:20:44,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 14:20:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:44,480 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 14:20:44,481 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:44,492 INFO L377 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 12 treesize of output 8 [2019-12-07 14:20:44,492 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:20:44,496 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:44,496 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:20:44,496 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 14:20:44,615 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:20:44,615 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2019-12-07 14:20:44,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:20:44,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:20:44,617 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:20:44,639 INFO L614 ElimStorePlain]: treesize reduction 4, result has 86.2 percent of original size [2019-12-07 14:20:44,640 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:20:44,640 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:16 [2019-12-07 14:20:44,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:20:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:20:44,673 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:20:44,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:20:44,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:20:44,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194769484] [2019-12-07 14:20:44,855 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2019-12-07 14:20:44,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1280744511] [2019-12-07 14:20:44,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:20:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:44,940 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 14:20:44,941 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:44,943 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@7c7f20dc [2019-12-07 14:20:44,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057508514] [2019-12-07 14:20:44,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f705082-7dfa-4308-b3e0-9e9c8fd6458c/bin/utaipan/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-12-07 14:20:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:20:44,982 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 14:20:44,983 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:20:44,985 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@7c7f20dc [2019-12-07 14:20:44,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:20:44,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 14:20:44,985 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 14:20:44,985 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:20:45,589 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3,22 cvc4 --incremental --print-success --lang smt --rewrite-divk,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:20:45,604 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 14:20:45,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:20:45 BoogieIcfgContainer [2019-12-07 14:20:45,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:20:45,605 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:20:45,605 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:20:45,605 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:20:45,606 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:20:27" (3/4) ... [2019-12-07 14:20:45,608 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 14:20:45,608 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:20:45,609 INFO L168 Benchmark]: Toolchain (without parser) took 18694.51 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 290.5 MB). Free memory was 948.4 MB in the beginning and 1.0 GB in the end (delta: -97.7 MB). Peak memory consumption was 192.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:20:45,609 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:20:45,609 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:20:45,609 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.30 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:20:45,610 INFO L168 Benchmark]: Boogie Preprocessor took 21.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:20:45,610 INFO L168 Benchmark]: RCFGBuilder took 324.28 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:20:45,610 INFO L168 Benchmark]: TraceAbstraction took 17993.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 146.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.8 MB). Peak memory consumption was 187.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:20:45,610 INFO L168 Benchmark]: Witness Printer took 2.98 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:20:45,612 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 317.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.30 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 324.28 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17993.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 146.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.8 MB). Peak memory consumption was 187.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.98 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 517]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L526] int length1 = __VERIFIER_nondet_int(); [L527] int length2 = __VERIFIER_nondet_int(); [L528] COND TRUE length1 < 1 [L529] length1 = 1 [L531] COND TRUE length2 < 1 [L532] length2 = 1 [L534] char* nondetString1 = (char*) __builtin_alloca (length1 * sizeof(char)); [L535] char* nondetString2 = (char*) __builtin_alloca (length2 * sizeof(char)); [L537] int i = 0; [L537] COND FALSE !(i < length1 - 1) [L542] int i = 0; [L542] COND FALSE !(i < length2 - 1) [L547] nondetString1[length1-1] = '\0' [L548] nondetString2[length2-1] = '\0' [L516] unsigned char uc1, uc2; [L517] EXPR \read(*s1) [L517] *s1 != '\0' && *s1 == *s2 [L517] EXPR \read(*s1) [L517] EXPR \read(*s2) [L517] *s1 != '\0' && *s1 == *s2 [L517] COND TRUE *s1 != '\0' && *s1 == *s2 [L518] s1++ [L519] s2++ [L517] \read(*s1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 19 error locations. Result: UNKNOWN, OverallTime: 17.9s, OverallIterations: 16, TraceHistogramMax: 2, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 552 SDtfs, 3260 SDslu, 1076 SDs, 0 SdLazy, 1009 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 416 GetRequests, 294 SyntacticMatches, 10 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 552 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 384 ConstructedInterpolants, 8 QuantifiedInterpolants, 34174 SizeOfPredicates, 114 NumberOfNonLiveVariables, 746 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 38 InterpolantComputations, 26 PerfectInterpolantSequences, 2/26 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...