./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/lockfree-3.3.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_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/lockfree-3.3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 9f2a2a3db64819077b17ec0cac240c138be80e0f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/lockfree-3.3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 9f2a2a3db64819077b17ec0cac240c138be80e0f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:52:11,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:52:11,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:52:11,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:52:11,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:52:11,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:52:11,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:52:11,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:52:11,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:52:11,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:52:11,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:52:11,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:52:11,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:52:11,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:52:11,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:52:11,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:52:11,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:52:11,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:52:11,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:52:11,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:52:11,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:52:11,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:52:11,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:52:11,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:52:11,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:52:11,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:52:11,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:52:11,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:52:11,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:52:11,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:52:11,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:52:11,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:52:11,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:52:11,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:52:11,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:52:11,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:52:11,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:52:11,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:52:11,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:52:11,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:52:11,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:52:11,294 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 13:52:11,308 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:52:11,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:52:11,309 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:52:11,309 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:52:11,309 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:52:11,309 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:52:11,309 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:52:11,309 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:52:11,310 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:52:11,310 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:52:11,310 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:52:11,310 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:52:11,310 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:52:11,311 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:52:11,311 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:52:11,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:52:11,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:52:11,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:52:11,312 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:52:11,312 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 13:52:11,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:52:11,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:52:11,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:52:11,312 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 13:52:11,312 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 13:52:11,313 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 13:52:11,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:52:11,313 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:52:11,313 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:52:11,313 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:52:11,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:52:11,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:52:11,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:52:11,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:52:11,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:52:11,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:52:11,314 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:52:11,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:52:11,314 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:52:11,314 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:52:11,314 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_f4d68466-42bb-4873-a043-643a8953e4fe/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 -> 9f2a2a3db64819077b17ec0cac240c138be80e0f [2019-12-07 13:52:11,412 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:52:11,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:52:11,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:52:11,426 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:52:11,426 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:52:11,427 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/../../sv-benchmarks/c/memsafety/lockfree-3.3.i [2019-12-07 13:52:11,467 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/data/584890473/425016568526418e81f9c554160ce762/FLAG2df7e764a [2019-12-07 13:52:11,931 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:52:11,931 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/sv-benchmarks/c/memsafety/lockfree-3.3.i [2019-12-07 13:52:11,940 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/data/584890473/425016568526418e81f9c554160ce762/FLAG2df7e764a [2019-12-07 13:52:11,948 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/data/584890473/425016568526418e81f9c554160ce762 [2019-12-07 13:52:11,950 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:52:11,951 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:52:11,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:52:11,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:52:11,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:52:11,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:52:11" (1/1) ... [2019-12-07 13:52:11,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@731888a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:52:11, skipping insertion in model container [2019-12-07 13:52:11,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:52:11" (1/1) ... [2019-12-07 13:52:11,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:52:11,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:52:12,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:52:12,221 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:52:12,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:52:12,280 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:52:12,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:52:12 WrapperNode [2019-12-07 13:52:12,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:52:12,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:52:12,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:52:12,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:52:12,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:52:12" (1/1) ... [2019-12-07 13:52:12,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:52:12" (1/1) ... [2019-12-07 13:52:12,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:52:12,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:52:12,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:52:12,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:52:12,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:52:12" (1/1) ... [2019-12-07 13:52:12,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:52:12" (1/1) ... [2019-12-07 13:52:12,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:52:12" (1/1) ... [2019-12-07 13:52:12,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:52:12" (1/1) ... [2019-12-07 13:52:12,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:52:12" (1/1) ... [2019-12-07 13:52:12,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:52:12" (1/1) ... [2019-12-07 13:52:12,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:52:12" (1/1) ... [2019-12-07 13:52:12,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:52:12,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:52:12,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:52:12,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:52:12,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:52:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:52:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 13:52:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:52:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:52:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:52:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:52:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:52:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:52:12,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:52:12,699 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:52:12,699 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-12-07 13:52:12,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:52:12 BoogieIcfgContainer [2019-12-07 13:52:12,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:52:12,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:52:12,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:52:12,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:52:12,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:52:11" (1/3) ... [2019-12-07 13:52:12,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ff31a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:52:12, skipping insertion in model container [2019-12-07 13:52:12,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:52:12" (2/3) ... [2019-12-07 13:52:12,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ff31a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:52:12, skipping insertion in model container [2019-12-07 13:52:12,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:52:12" (3/3) ... [2019-12-07 13:52:12,704 INFO L109 eAbstractionObserver]: Analyzing ICFG lockfree-3.3.i [2019-12-07 13:52:12,710 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:52:12,715 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-12-07 13:52:12,722 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-12-07 13:52:12,734 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:52:12,734 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 13:52:12,734 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:52:12,734 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:52:12,734 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:52:12,734 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:52:12,734 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:52:12,734 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:52:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-12-07 13:52:12,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 13:52:12,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:12,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 13:52:12,749 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:12,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:12,753 INFO L82 PathProgramCache]: Analyzing trace with hash 5759830, now seen corresponding path program 1 times [2019-12-07 13:52:12,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:12,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511083438] [2019-12-07 13:52:12,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:12,835 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 13:52:12,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511083438] [2019-12-07 13:52:12,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:52:12,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:52:12,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840955542] [2019-12-07 13:52:12,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 13:52:12,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:12,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 13:52:12,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 13:52:12,850 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-12-07 13:52:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:12,860 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2019-12-07 13:52:12,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 13:52:12,861 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-12-07 13:52:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:12,867 INFO L225 Difference]: With dead ends: 47 [2019-12-07 13:52:12,867 INFO L226 Difference]: Without dead ends: 46 [2019-12-07 13:52:12,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 13:52:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-07 13:52:12,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-12-07 13:52:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 13:52:12,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2019-12-07 13:52:12,891 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 4 [2019-12-07 13:52:12,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:12,891 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2019-12-07 13:52:12,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 13:52:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2019-12-07 13:52:12,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:52:12,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:12,892 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 13:52:12,892 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:12,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:12,892 INFO L82 PathProgramCache]: Analyzing trace with hash 179809423, now seen corresponding path program 1 times [2019-12-07 13:52:12,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:12,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499782711] [2019-12-07 13:52:12,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:12,926 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 13:52:12,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499782711] [2019-12-07 13:52:12,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:52:12,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:52:12,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380596984] [2019-12-07 13:52:12,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:52:12,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:12,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:52:12,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:52:12,929 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand 3 states. [2019-12-07 13:52:12,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:12,974 INFO L93 Difference]: Finished difference Result 84 states and 106 transitions. [2019-12-07 13:52:12,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:52:12,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 13:52:12,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:12,975 INFO L225 Difference]: With dead ends: 84 [2019-12-07 13:52:12,975 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 13:52:12,976 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 13:52:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 13:52:12,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2019-12-07 13:52:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 13:52:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2019-12-07 13:52:12,982 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 96 transitions. Word has length 5 [2019-12-07 13:52:12,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:12,982 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 96 transitions. [2019-12-07 13:52:12,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:52:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 96 transitions. [2019-12-07 13:52:12,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:52:12,983 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:12,983 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 13:52:12,983 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:12,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:12,983 INFO L82 PathProgramCache]: Analyzing trace with hash 179808479, now seen corresponding path program 1 times [2019-12-07 13:52:12,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:12,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442699885] [2019-12-07 13:52:12,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:13,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 13:52:13,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442699885] [2019-12-07 13:52:13,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:52:13,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:52:13,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869456365] [2019-12-07 13:52:13,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:52:13,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:13,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:52:13,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:52:13,006 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. Second operand 3 states. [2019-12-07 13:52:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:13,026 INFO L93 Difference]: Finished difference Result 116 states and 179 transitions. [2019-12-07 13:52:13,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:52:13,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 13:52:13,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:13,027 INFO L225 Difference]: With dead ends: 116 [2019-12-07 13:52:13,027 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 13:52:13,028 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 13:52:13,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 13:52:13,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2019-12-07 13:52:13,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 13:52:13,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 166 transitions. [2019-12-07 13:52:13,035 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 166 transitions. Word has length 5 [2019-12-07 13:52:13,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:13,035 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 166 transitions. [2019-12-07 13:52:13,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:52:13,035 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 166 transitions. [2019-12-07 13:52:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 13:52:13,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:13,035 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 13:52:13,036 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:13,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:13,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1279039128, now seen corresponding path program 1 times [2019-12-07 13:52:13,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:13,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296388608] [2019-12-07 13:52:13,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:13,068 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 13:52:13,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296388608] [2019-12-07 13:52:13,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:52:13,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:52:13,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356635725] [2019-12-07 13:52:13,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:52:13,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:13,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:52:13,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:52:13,069 INFO L87 Difference]: Start difference. First operand 97 states and 166 transitions. Second operand 3 states. [2019-12-07 13:52:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:13,119 INFO L93 Difference]: Finished difference Result 146 states and 235 transitions. [2019-12-07 13:52:13,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:52:13,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 13:52:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:13,121 INFO L225 Difference]: With dead ends: 146 [2019-12-07 13:52:13,121 INFO L226 Difference]: Without dead ends: 146 [2019-12-07 13:52:13,121 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 13:52:13,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-07 13:52:13,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 127. [2019-12-07 13:52:13,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 13:52:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 223 transitions. [2019-12-07 13:52:13,130 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 223 transitions. Word has length 6 [2019-12-07 13:52:13,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:13,130 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 223 transitions. [2019-12-07 13:52:13,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:52:13,130 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 223 transitions. [2019-12-07 13:52:13,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 13:52:13,130 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:13,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 13:52:13,130 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:13,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:13,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1279039129, now seen corresponding path program 1 times [2019-12-07 13:52:13,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:13,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712221641] [2019-12-07 13:52:13,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:13,160 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 13:52:13,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712221641] [2019-12-07 13:52:13,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:52:13,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:52:13,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137259127] [2019-12-07 13:52:13,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:52:13,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:13,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:52:13,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:52:13,161 INFO L87 Difference]: Start difference. First operand 127 states and 223 transitions. Second operand 3 states. [2019-12-07 13:52:13,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:13,201 INFO L93 Difference]: Finished difference Result 141 states and 226 transitions. [2019-12-07 13:52:13,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:52:13,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 13:52:13,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:13,203 INFO L225 Difference]: With dead ends: 141 [2019-12-07 13:52:13,203 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 13:52:13,203 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 13:52:13,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 13:52:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 125. [2019-12-07 13:52:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-07 13:52:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 215 transitions. [2019-12-07 13:52:13,211 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 215 transitions. Word has length 6 [2019-12-07 13:52:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:13,211 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 215 transitions. [2019-12-07 13:52:13,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:52:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 215 transitions. [2019-12-07 13:52:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:52:13,211 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:13,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:52:13,212 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:13,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:13,212 INFO L82 PathProgramCache]: Analyzing trace with hash 995515308, now seen corresponding path program 1 times [2019-12-07 13:52:13,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:13,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965772817] [2019-12-07 13:52:13,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:13,238 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 13:52:13,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965772817] [2019-12-07 13:52:13,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:52:13,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:52:13,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875816033] [2019-12-07 13:52:13,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:52:13,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:13,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:52:13,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:52:13,240 INFO L87 Difference]: Start difference. First operand 125 states and 215 transitions. Second operand 6 states. [2019-12-07 13:52:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:13,274 INFO L93 Difference]: Finished difference Result 215 states and 338 transitions. [2019-12-07 13:52:13,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:52:13,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 13:52:13,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:13,276 INFO L225 Difference]: With dead ends: 215 [2019-12-07 13:52:13,276 INFO L226 Difference]: Without dead ends: 215 [2019-12-07 13:52:13,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:52:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-12-07 13:52:13,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 153. [2019-12-07 13:52:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-07 13:52:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 266 transitions. [2019-12-07 13:52:13,289 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 266 transitions. Word has length 7 [2019-12-07 13:52:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:13,289 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 266 transitions. [2019-12-07 13:52:13,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:52:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 266 transitions. [2019-12-07 13:52:13,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 13:52:13,290 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:13,290 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:52:13,290 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:13,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:13,291 INFO L82 PathProgramCache]: Analyzing trace with hash 846604953, now seen corresponding path program 1 times [2019-12-07 13:52:13,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:13,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57810033] [2019-12-07 13:52:13,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:13,318 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 13:52:13,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57810033] [2019-12-07 13:52:13,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:52:13,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:52:13,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626825572] [2019-12-07 13:52:13,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:52:13,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:13,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:52:13,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:52:13,319 INFO L87 Difference]: Start difference. First operand 153 states and 266 transitions. Second operand 5 states. [2019-12-07 13:52:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:13,352 INFO L93 Difference]: Finished difference Result 373 states and 588 transitions. [2019-12-07 13:52:13,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:52:13,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 13:52:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:13,354 INFO L225 Difference]: With dead ends: 373 [2019-12-07 13:52:13,354 INFO L226 Difference]: Without dead ends: 373 [2019-12-07 13:52:13,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:52:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-12-07 13:52:13,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 265. [2019-12-07 13:52:13,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-07 13:52:13,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 437 transitions. [2019-12-07 13:52:13,364 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 437 transitions. Word has length 8 [2019-12-07 13:52:13,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:13,364 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 437 transitions. [2019-12-07 13:52:13,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:52:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 437 transitions. [2019-12-07 13:52:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:52:13,364 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:13,365 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:52:13,365 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:13,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:13,365 INFO L82 PathProgramCache]: Analyzing trace with hash -206056393, now seen corresponding path program 1 times [2019-12-07 13:52:13,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:13,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832056307] [2019-12-07 13:52:13,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:52:13,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832056307] [2019-12-07 13:52:13,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:52:13,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:52:13,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028799775] [2019-12-07 13:52:13,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:52:13,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:13,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:52:13,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:52:13,399 INFO L87 Difference]: Start difference. First operand 265 states and 437 transitions. Second operand 5 states. [2019-12-07 13:52:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:13,430 INFO L93 Difference]: Finished difference Result 331 states and 537 transitions. [2019-12-07 13:52:13,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:52:13,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 13:52:13,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:13,432 INFO L225 Difference]: With dead ends: 331 [2019-12-07 13:52:13,432 INFO L226 Difference]: Without dead ends: 331 [2019-12-07 13:52:13,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 13:52:13,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-07 13:52:13,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 325. [2019-12-07 13:52:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-12-07 13:52:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 537 transitions. [2019-12-07 13:52:13,442 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 537 transitions. Word has length 11 [2019-12-07 13:52:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:13,443 INFO L462 AbstractCegarLoop]: Abstraction has 325 states and 537 transitions. [2019-12-07 13:52:13,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:52:13,443 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 537 transitions. [2019-12-07 13:52:13,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 13:52:13,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:13,444 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 13:52:13,444 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:13,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:13,444 INFO L82 PathProgramCache]: Analyzing trace with hash -733573292, now seen corresponding path program 1 times [2019-12-07 13:52:13,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:13,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291588952] [2019-12-07 13:52:13,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:52:13,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291588952] [2019-12-07 13:52:13,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561420599] [2019-12-07 13:52:13,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:52:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:13,525 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 13:52:13,528 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:52:13,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:52:13,554 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:52:13,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:52:13,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [936573517] [2019-12-07 13:52:13,590 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2019-12-07 13:52:13,590 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:52:13,594 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:52:13,598 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:52:13,598 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:52:13,937 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:52:14,114 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-12-07 13:52:14,396 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2019-12-07 13:52:14,712 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 69 [2019-12-07 13:52:14,905 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2019-12-07 13:52:15,028 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-12-07 13:52:15,174 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-12-07 13:52:15,339 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-07 13:52:15,501 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-12-07 13:52:15,502 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:52:15,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:52:15,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2019-12-07 13:52:15,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667464276] [2019-12-07 13:52:15,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:52:15,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:15,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:52:15,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:52:15,504 INFO L87 Difference]: Start difference. First operand 325 states and 537 transitions. Second operand 8 states. [2019-12-07 13:52:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:15,587 INFO L93 Difference]: Finished difference Result 717 states and 1116 transitions. [2019-12-07 13:52:15,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:52:15,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-12-07 13:52:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:15,593 INFO L225 Difference]: With dead ends: 717 [2019-12-07 13:52:15,593 INFO L226 Difference]: Without dead ends: 717 [2019-12-07 13:52:15,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:52:15,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-12-07 13:52:15,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 465. [2019-12-07 13:52:15,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-12-07 13:52:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 758 transitions. [2019-12-07 13:52:15,609 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 758 transitions. Word has length 12 [2019-12-07 13:52:15,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:15,610 INFO L462 AbstractCegarLoop]: Abstraction has 465 states and 758 transitions. [2019-12-07 13:52:15,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:52:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 758 transitions. [2019-12-07 13:52:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:52:15,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:15,611 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 13:52:15,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:52:15,812 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:15,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:15,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1744358578, now seen corresponding path program 1 times [2019-12-07 13:52:15,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:15,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247529873] [2019-12-07 13:52:15,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:52:15,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247529873] [2019-12-07 13:52:15,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:52:15,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:52:15,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462780349] [2019-12-07 13:52:15,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:52:15,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:15,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:52:15,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:52:15,866 INFO L87 Difference]: Start difference. First operand 465 states and 758 transitions. Second operand 4 states. [2019-12-07 13:52:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:15,882 INFO L93 Difference]: Finished difference Result 356 states and 521 transitions. [2019-12-07 13:52:15,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:52:15,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 13:52:15,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:15,884 INFO L225 Difference]: With dead ends: 356 [2019-12-07 13:52:15,884 INFO L226 Difference]: Without dead ends: 356 [2019-12-07 13:52:15,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 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 13:52:15,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-07 13:52:15,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 267. [2019-12-07 13:52:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-12-07 13:52:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 408 transitions. [2019-12-07 13:52:15,889 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 408 transitions. Word has length 14 [2019-12-07 13:52:15,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:15,889 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 408 transitions. [2019-12-07 13:52:15,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:52:15,890 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 408 transitions. [2019-12-07 13:52:15,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 13:52:15,890 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:15,890 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 13:52:15,890 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:15,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:15,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1739951187, now seen corresponding path program 1 times [2019-12-07 13:52:15,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:15,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295355518] [2019-12-07 13:52:15,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:52:15,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295355518] [2019-12-07 13:52:15,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398048974] [2019-12-07 13:52:15,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:52:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:16,002 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 13:52:16,002 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:52:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:52:16,022 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:52:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:52:16,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [544356877] [2019-12-07 13:52:16,040 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2019-12-07 13:52:16,040 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:52:16,040 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:52:16,040 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:52:16,040 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:52:16,585 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:52:16,726 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-12-07 13:52:17,039 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-12-07 13:52:17,402 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2019-12-07 13:52:17,630 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-12-07 13:52:17,821 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-12-07 13:52:18,136 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-12-07 13:52:18,330 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-07 13:52:18,493 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-12-07 13:52:18,494 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:52:18,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:52:18,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2019-12-07 13:52:18,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715628161] [2019-12-07 13:52:18,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:52:18,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:18,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:52:18,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-12-07 13:52:18,495 INFO L87 Difference]: Start difference. First operand 267 states and 408 transitions. Second operand 13 states. [2019-12-07 13:52:18,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:18,909 INFO L93 Difference]: Finished difference Result 1706 states and 2502 transitions. [2019-12-07 13:52:18,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 13:52:18,909 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-12-07 13:52:18,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:18,916 INFO L225 Difference]: With dead ends: 1706 [2019-12-07 13:52:18,916 INFO L226 Difference]: Without dead ends: 1706 [2019-12-07 13:52:18,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=250, Invalid=1156, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 13:52:18,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-12-07 13:52:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 850. [2019-12-07 13:52:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-12-07 13:52:18,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1311 transitions. [2019-12-07 13:52:18,936 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1311 transitions. Word has length 17 [2019-12-07 13:52:18,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:18,936 INFO L462 AbstractCegarLoop]: Abstraction has 850 states and 1311 transitions. [2019-12-07 13:52:18,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 13:52:18,936 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1311 transitions. [2019-12-07 13:52:18,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:52:18,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:18,937 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:52:19,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:52:19,138 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:19,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:19,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1774850669, now seen corresponding path program 1 times [2019-12-07 13:52:19,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:19,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216322973] [2019-12-07 13:52:19,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:52:19,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216322973] [2019-12-07 13:52:19,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255653432] [2019-12-07 13:52:19,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:52:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:19,228 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 13:52:19,230 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:52:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:52:19,255 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:52:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:52:19,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [644545786] [2019-12-07 13:52:19,280 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:52:19,280 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:52:19,280 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:52:19,280 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:52:19,280 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:52:19,429 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:52:19,763 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:52:20,344 WARN L192 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 105 [2019-12-07 13:52:20,860 WARN L192 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 122 [2019-12-07 13:52:21,009 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-12-07 13:52:21,182 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-12-07 13:52:21,425 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-12-07 13:52:21,634 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-12-07 13:52:21,793 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-12-07 13:52:21,935 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-12-07 13:52:21,936 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:52:21,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:52:21,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2019-12-07 13:52:21,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259954849] [2019-12-07 13:52:21,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:52:21,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:21,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:52:21,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:52:21,937 INFO L87 Difference]: Start difference. First operand 850 states and 1311 transitions. Second operand 7 states. [2019-12-07 13:52:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:22,099 INFO L93 Difference]: Finished difference Result 1748 states and 2617 transitions. [2019-12-07 13:52:22,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:52:22,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-07 13:52:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:22,106 INFO L225 Difference]: With dead ends: 1748 [2019-12-07 13:52:22,106 INFO L226 Difference]: Without dead ends: 1748 [2019-12-07 13:52:22,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-12-07 13:52:22,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-12-07 13:52:22,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1104. [2019-12-07 13:52:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-12-07 13:52:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1698 transitions. [2019-12-07 13:52:22,125 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1698 transitions. Word has length 18 [2019-12-07 13:52:22,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:22,125 INFO L462 AbstractCegarLoop]: Abstraction has 1104 states and 1698 transitions. [2019-12-07 13:52:22,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:52:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1698 transitions. [2019-12-07 13:52:22,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:52:22,126 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:22,126 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:52:22,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:52:22,326 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:22,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:22,327 INFO L82 PathProgramCache]: Analyzing trace with hash 568927024, now seen corresponding path program 1 times [2019-12-07 13:52:22,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:22,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137285708] [2019-12-07 13:52:22,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:52:22,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137285708] [2019-12-07 13:52:22,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567404525] [2019-12-07 13:52:22,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:52:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:22,410 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 13:52:22,411 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:52:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:52:22,427 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:52:22,443 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:52:22,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1727578919] [2019-12-07 13:52:22,445 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 13:52:22,445 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:52:22,445 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:52:22,445 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:52:22,445 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:52:22,793 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:52:22,934 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-12-07 13:52:23,192 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2019-12-07 13:52:23,329 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-12-07 13:52:23,480 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2019-12-07 13:52:23,666 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-12-07 13:52:23,988 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-07 13:52:24,354 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2019-12-07 13:52:24,634 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-12-07 13:52:24,816 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-12-07 13:52:24,817 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:52:24,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:52:24,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2019-12-07 13:52:24,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965960214] [2019-12-07 13:52:24,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:52:24,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:24,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:52:24,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:52:24,818 INFO L87 Difference]: Start difference. First operand 1104 states and 1698 transitions. Second operand 7 states. [2019-12-07 13:52:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:24,900 INFO L93 Difference]: Finished difference Result 1491 states and 2262 transitions. [2019-12-07 13:52:24,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:52:24,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-12-07 13:52:24,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:24,906 INFO L225 Difference]: With dead ends: 1491 [2019-12-07 13:52:24,906 INFO L226 Difference]: Without dead ends: 1491 [2019-12-07 13:52:24,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2019-12-07 13:52:24,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2019-12-07 13:52:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 926. [2019-12-07 13:52:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-12-07 13:52:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1448 transitions. [2019-12-07 13:52:24,921 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1448 transitions. Word has length 20 [2019-12-07 13:52:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:24,922 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1448 transitions. [2019-12-07 13:52:24,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:52:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1448 transitions. [2019-12-07 13:52:24,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 13:52:24,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:24,922 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:52:25,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:52:25,123 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:25,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:25,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1045998401, now seen corresponding path program 1 times [2019-12-07 13:52:25,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:25,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680649577] [2019-12-07 13:52:25,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 13:52:25,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680649577] [2019-12-07 13:52:25,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526957039] [2019-12-07 13:52:25,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:52:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:25,218 INFO L264 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 13:52:25,219 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:52:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 13:52:25,239 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:52:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 13:52:25,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [805267190] [2019-12-07 13:52:25,255 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 13:52:25,255 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:52:25,256 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:52:25,256 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:52:25,256 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:52:25,687 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:52:26,065 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:52:26,621 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:52:26,972 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-12-07 13:52:27,243 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-12-07 13:52:27,612 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 58 [2019-12-07 13:52:27,935 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-12-07 13:52:28,446 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-12-07 13:52:28,681 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2019-12-07 13:52:28,682 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:52:28,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:52:28,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2019-12-07 13:52:28,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181018869] [2019-12-07 13:52:28,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:52:28,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:28,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:52:28,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:52:28,683 INFO L87 Difference]: Start difference. First operand 926 states and 1448 transitions. Second operand 9 states. [2019-12-07 13:52:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:28,812 INFO L93 Difference]: Finished difference Result 1993 states and 2997 transitions. [2019-12-07 13:52:28,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:52:28,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-07 13:52:28,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:28,820 INFO L225 Difference]: With dead ends: 1993 [2019-12-07 13:52:28,820 INFO L226 Difference]: Without dead ends: 1945 [2019-12-07 13:52:28,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2019-12-07 13:52:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2019-12-07 13:52:28,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1692. [2019-12-07 13:52:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1692 states. [2019-12-07 13:52:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 2614 transitions. [2019-12-07 13:52:28,851 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 2614 transitions. Word has length 24 [2019-12-07 13:52:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:28,852 INFO L462 AbstractCegarLoop]: Abstraction has 1692 states and 2614 transitions. [2019-12-07 13:52:28,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:52:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2614 transitions. [2019-12-07 13:52:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:52:28,853 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:28,853 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 13:52:29,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:52:29,054 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:29,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:29,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1575099993, now seen corresponding path program 1 times [2019-12-07 13:52:29,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:29,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974349184] [2019-12-07 13:52:29,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:29,138 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:52:29,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974349184] [2019-12-07 13:52:29,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873438903] [2019-12-07 13:52:29,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:52:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:29,175 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 13:52:29,176 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:52:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:52:29,201 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:52:29,221 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:52:29,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [853794958] [2019-12-07 13:52:29,221 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 13:52:29,222 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:52:29,222 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:52:29,222 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:52:29,222 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:52:29,751 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:52:29,895 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2019-12-07 13:52:30,069 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-12-07 13:52:30,277 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 63 [2019-12-07 13:52:30,527 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-12-07 13:52:30,676 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-12-07 13:52:30,830 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-07 13:52:30,989 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2019-12-07 13:52:31,216 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-12-07 13:52:31,464 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-12-07 13:52:31,465 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:52:31,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:52:31,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-12-07 13:52:31,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050899744] [2019-12-07 13:52:31,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:52:31,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:31,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:52:31,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:52:31,466 INFO L87 Difference]: Start difference. First operand 1692 states and 2614 transitions. Second operand 10 states. [2019-12-07 13:52:31,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:31,848 INFO L93 Difference]: Finished difference Result 3405 states and 5179 transitions. [2019-12-07 13:52:31,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:52:31,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-12-07 13:52:31,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:31,868 INFO L225 Difference]: With dead ends: 3405 [2019-12-07 13:52:31,868 INFO L226 Difference]: Without dead ends: 3405 [2019-12-07 13:52:31,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2019-12-07 13:52:31,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2019-12-07 13:52:31,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 2188. [2019-12-07 13:52:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2188 states. [2019-12-07 13:52:31,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 3403 transitions. [2019-12-07 13:52:31,896 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 3403 transitions. Word has length 27 [2019-12-07 13:52:31,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:31,896 INFO L462 AbstractCegarLoop]: Abstraction has 2188 states and 3403 transitions. [2019-12-07 13:52:31,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:52:31,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 3403 transitions. [2019-12-07 13:52:31,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 13:52:31,897 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:31,897 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:52:32,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:52:32,098 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:32,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:32,099 INFO L82 PathProgramCache]: Analyzing trace with hash 724875183, now seen corresponding path program 1 times [2019-12-07 13:52:32,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:32,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115650023] [2019-12-07 13:52:32,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:52:32,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115650023] [2019-12-07 13:52:32,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120327942] [2019-12-07 13:52:32,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:52:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:32,207 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 13:52:32,208 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:52:32,230 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:52:32,231 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:52:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:52:32,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1868213450] [2019-12-07 13:52:32,258 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 13:52:32,258 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:52:32,258 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:52:32,258 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:52:32,258 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:52:32,871 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:52:33,263 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:52:33,845 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:52:34,164 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-12-07 13:52:34,513 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 50 [2019-12-07 13:52:34,654 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-12-07 13:52:35,161 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:52:35,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:52:35,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2019-12-07 13:52:35,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933156391] [2019-12-07 13:52:35,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:52:35,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:35,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:52:35,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:52:35,162 INFO L87 Difference]: Start difference. First operand 2188 states and 3403 transitions. Second operand 9 states. [2019-12-07 13:52:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:35,325 INFO L93 Difference]: Finished difference Result 3519 states and 5284 transitions. [2019-12-07 13:52:35,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:52:35,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-12-07 13:52:35,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:35,339 INFO L225 Difference]: With dead ends: 3519 [2019-12-07 13:52:35,339 INFO L226 Difference]: Without dead ends: 3459 [2019-12-07 13:52:35,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2019-12-07 13:52:35,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3459 states. [2019-12-07 13:52:35,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3459 to 2762. [2019-12-07 13:52:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2019-12-07 13:52:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 4193 transitions. [2019-12-07 13:52:35,368 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 4193 transitions. Word has length 30 [2019-12-07 13:52:35,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:35,368 INFO L462 AbstractCegarLoop]: Abstraction has 2762 states and 4193 transitions. [2019-12-07 13:52:35,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:52:35,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 4193 transitions. [2019-12-07 13:52:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:52:35,368 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:35,368 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:52:35,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:52:35,569 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:35,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:35,570 INFO L82 PathProgramCache]: Analyzing trace with hash -449030937, now seen corresponding path program 1 times [2019-12-07 13:52:35,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:35,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378049018] [2019-12-07 13:52:35,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:52:35,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378049018] [2019-12-07 13:52:35,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603937330] [2019-12-07 13:52:35,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:52:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:35,655 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 13:52:35,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:52:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:52:35,686 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:52:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:52:35,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2017683300] [2019-12-07 13:52:35,702 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 13:52:35,702 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:52:35,702 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:52:35,703 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:52:35,703 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:52:36,231 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:52:36,376 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-12-07 13:52:36,623 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-07 13:52:36,912 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2019-12-07 13:52:37,330 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-12-07 13:52:37,628 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-07 13:52:37,950 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2019-12-07 13:52:38,261 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-12-07 13:52:38,534 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-12-07 13:52:38,534 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:52:38,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:52:38,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2019-12-07 13:52:38,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399082520] [2019-12-07 13:52:38,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:52:38,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:38,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:52:38,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-12-07 13:52:38,537 INFO L87 Difference]: Start difference. First operand 2762 states and 4193 transitions. Second operand 13 states. [2019-12-07 13:52:39,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:39,111 INFO L93 Difference]: Finished difference Result 6865 states and 9971 transitions. [2019-12-07 13:52:39,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 13:52:39,111 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-12-07 13:52:39,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:39,133 INFO L225 Difference]: With dead ends: 6865 [2019-12-07 13:52:39,133 INFO L226 Difference]: Without dead ends: 6845 [2019-12-07 13:52:39,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=435, Invalid=2015, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 13:52:39,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6845 states. [2019-12-07 13:52:39,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6845 to 4171. [2019-12-07 13:52:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4171 states. [2019-12-07 13:52:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 6176 transitions. [2019-12-07 13:52:39,180 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 6176 transitions. Word has length 32 [2019-12-07 13:52:39,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:39,181 INFO L462 AbstractCegarLoop]: Abstraction has 4171 states and 6176 transitions. [2019-12-07 13:52:39,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 13:52:39,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 6176 transitions. [2019-12-07 13:52:39,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:52:39,181 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:39,181 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 13:52:39,382 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:52:39,382 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:39,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:39,383 INFO L82 PathProgramCache]: Analyzing trace with hash -347915765, now seen corresponding path program 1 times [2019-12-07 13:52:39,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:39,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393758391] [2019-12-07 13:52:39,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:52:39,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393758391] [2019-12-07 13:52:39,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086605898] [2019-12-07 13:52:39,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:52:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:39,488 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 13:52:39,489 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:52:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:52:39,514 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:52:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:52:39,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [580436339] [2019-12-07 13:52:39,530 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 13:52:39,531 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:52:39,531 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:52:39,531 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:52:39,531 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:52:40,012 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:52:40,156 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-12-07 13:52:40,331 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-12-07 13:52:40,542 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 63 [2019-12-07 13:52:40,804 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-12-07 13:52:40,986 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-12-07 13:52:41,213 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-07 13:52:41,442 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2019-12-07 13:52:41,613 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-12-07 13:52:41,766 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-12-07 13:52:41,766 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:52:41,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:52:41,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2019-12-07 13:52:41,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564179516] [2019-12-07 13:52:41,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:52:41,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:41,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:52:41,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:52:41,767 INFO L87 Difference]: Start difference. First operand 4171 states and 6176 transitions. Second operand 10 states. [2019-12-07 13:52:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:42,126 INFO L93 Difference]: Finished difference Result 4763 states and 6748 transitions. [2019-12-07 13:52:42,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 13:52:42,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-12-07 13:52:42,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:42,139 INFO L225 Difference]: With dead ends: 4763 [2019-12-07 13:52:42,139 INFO L226 Difference]: Without dead ends: 4707 [2019-12-07 13:52:42,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=177, Invalid=815, Unknown=0, NotChecked=0, Total=992 [2019-12-07 13:52:42,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4707 states. [2019-12-07 13:52:42,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4707 to 2947. [2019-12-07 13:52:42,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2947 states. [2019-12-07 13:52:42,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 4245 transitions. [2019-12-07 13:52:42,175 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 4245 transitions. Word has length 33 [2019-12-07 13:52:42,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:42,175 INFO L462 AbstractCegarLoop]: Abstraction has 2947 states and 4245 transitions. [2019-12-07 13:52:42,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:52:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 4245 transitions. [2019-12-07 13:52:42,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 13:52:42,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:42,176 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:52:42,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:52:42,376 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:42,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:42,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1995791876, now seen corresponding path program 1 times [2019-12-07 13:52:42,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:42,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864809850] [2019-12-07 13:52:42,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 39 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 13:52:42,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864809850] [2019-12-07 13:52:42,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809174952] [2019-12-07 13:52:42,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:52:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:42,530 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 13:52:42,532 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:52:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 43 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 13:52:42,615 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:52:42,728 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 13:52:42,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1781576662] [2019-12-07 13:52:42,729 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 13:52:42,729 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:52:42,730 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:52:42,730 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:52:42,730 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:52:44,954 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:52:45,307 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-12-07 13:52:45,560 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-12-07 13:52:45,717 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 50 [2019-12-07 13:52:45,871 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-12-07 13:52:46,557 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:52:46,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:52:46,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2019-12-07 13:52:46,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264303600] [2019-12-07 13:52:46,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 13:52:46,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:46,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 13:52:46,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 13:52:46,558 INFO L87 Difference]: Start difference. First operand 2947 states and 4245 transitions. Second operand 23 states. [2019-12-07 13:52:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:49,003 INFO L93 Difference]: Finished difference Result 12231 states and 16971 transitions. [2019-12-07 13:52:49,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-07 13:52:49,004 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 38 [2019-12-07 13:52:49,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:49,017 INFO L225 Difference]: With dead ends: 12231 [2019-12-07 13:52:49,017 INFO L226 Difference]: Without dead ends: 11471 [2019-12-07 13:52:49,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 107 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2169 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1186, Invalid=5134, Unknown=0, NotChecked=0, Total=6320 [2019-12-07 13:52:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11471 states. [2019-12-07 13:52:49,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11471 to 5716. [2019-12-07 13:52:49,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5716 states. [2019-12-07 13:52:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5716 states to 5716 states and 8406 transitions. [2019-12-07 13:52:49,090 INFO L78 Accepts]: Start accepts. Automaton has 5716 states and 8406 transitions. Word has length 38 [2019-12-07 13:52:49,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:49,091 INFO L462 AbstractCegarLoop]: Abstraction has 5716 states and 8406 transitions. [2019-12-07 13:52:49,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 13:52:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 5716 states and 8406 transitions. [2019-12-07 13:52:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 13:52:49,092 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:49,092 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:52:49,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:52:49,293 INFO L410 AbstractCegarLoop]: === Iteration 20 === [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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:49,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:49,293 INFO L82 PathProgramCache]: Analyzing trace with hash -301283776, now seen corresponding path program 1 times [2019-12-07 13:52:49,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:52:49,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835444770] [2019-12-07 13:52:49,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:52:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 39 proven. 57 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 13:52:49,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835444770] [2019-12-07 13:52:49,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81862620] [2019-12-07 13:52:49,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:52:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:49,487 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 13:52:49,489 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:52:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 50 proven. 48 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:52:49,621 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:52:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 31 proven. 67 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:52:49,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1629625249] [2019-12-07 13:52:49,915 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 13:52:49,915 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:52:49,915 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:52:49,915 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:52:49,915 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:52:53,640 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:52:55,007 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:52:55,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:52:55,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 27 [2019-12-07 13:52:55,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239144274] [2019-12-07 13:52:55,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 13:52:55,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:52:55,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 13:52:55,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1519, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 13:52:55,009 INFO L87 Difference]: Start difference. First operand 5716 states and 8406 transitions. Second operand 28 states. [2019-12-07 13:52:55,788 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-12-07 13:52:56,008 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-12-07 13:52:56,448 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-12-07 13:52:56,668 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-12-07 13:52:56,894 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-07 13:52:57,054 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-12-07 13:52:57,431 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2019-12-07 13:52:57,585 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-12-07 13:52:58,688 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2019-12-07 13:53:01,512 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-12-07 13:53:01,695 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 32 [2019-12-07 13:53:01,988 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-12-07 13:53:02,261 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2019-12-07 13:53:02,618 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2019-12-07 13:53:02,851 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-12-07 13:53:03,152 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-12-07 13:53:03,545 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-12-07 13:53:03,804 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2019-12-07 13:53:04,127 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-12-07 13:53:04,292 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-12-07 13:53:04,583 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-12-07 13:53:04,780 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-12-07 13:53:05,294 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2019-12-07 13:53:05,507 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2019-12-07 13:53:05,805 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2019-12-07 13:53:05,991 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2019-12-07 13:53:06,356 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-12-07 13:53:06,616 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-12-07 13:53:09,088 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-12-07 13:53:12,717 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2019-12-07 13:53:14,079 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-12-07 13:53:14,736 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-12-07 13:53:15,101 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-12-07 13:53:15,724 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-12-07 13:53:15,996 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-12-07 13:53:16,215 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2019-12-07 13:53:16,479 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-12-07 13:53:16,717 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-12-07 13:53:17,487 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2019-12-07 13:53:17,683 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2019-12-07 13:53:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:17,808 INFO L93 Difference]: Finished difference Result 19961 states and 28199 transitions. [2019-12-07 13:53:17,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2019-12-07 13:53:17,808 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-12-07 13:53:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:17,826 INFO L225 Difference]: With dead ends: 19961 [2019-12-07 13:53:17,826 INFO L226 Difference]: Without dead ends: 19961 [2019-12-07 13:53:17,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 244 SyntacticMatches, 3 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22258 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=7531, Invalid=46061, Unknown=0, NotChecked=0, Total=53592 [2019-12-07 13:53:17,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19961 states. [2019-12-07 13:53:17,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19961 to 13936. [2019-12-07 13:53:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13936 states. [2019-12-07 13:53:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13936 states to 13936 states and 20136 transitions. [2019-12-07 13:53:17,994 INFO L78 Accepts]: Start accepts. Automaton has 13936 states and 20136 transitions. Word has length 50 [2019-12-07 13:53:17,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:17,994 INFO L462 AbstractCegarLoop]: Abstraction has 13936 states and 20136 transitions. [2019-12-07 13:53:17,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 13:53:17,994 INFO L276 IsEmpty]: Start isEmpty. Operand 13936 states and 20136 transitions. [2019-12-07 13:53:17,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 13:53:17,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:17,995 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:18,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:18,196 INFO L410 AbstractCegarLoop]: === Iteration 21 === [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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:18,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:18,197 INFO L82 PathProgramCache]: Analyzing trace with hash -301283777, now seen corresponding path program 1 times [2019-12-07 13:53:18,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:53:18,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617884715] [2019-12-07 13:53:18,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 50 proven. 48 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:53:18,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617884715] [2019-12-07 13:53:18,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970120606] [2019-12-07 13:53:18,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:18,389 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 13:53:18,390 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 50 proven. 48 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:53:18,439 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 31 proven. 67 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 13:53:18,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [215528774] [2019-12-07 13:53:18,573 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 13:53:18,573 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:53:18,573 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:53:18,573 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:53:18,573 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:53:22,235 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:53:23,425 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:53:23,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:53:23,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2019-12-07 13:53:23,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553044081] [2019-12-07 13:53:23,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 13:53:23,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:53:23,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 13:53:23,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2019-12-07 13:53:23,426 INFO L87 Difference]: Start difference. First operand 13936 states and 20136 transitions. Second operand 16 states. [2019-12-07 13:53:24,734 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-12-07 13:53:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:25,420 INFO L93 Difference]: Finished difference Result 17199 states and 24395 transitions. [2019-12-07 13:53:25,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 13:53:25,421 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2019-12-07 13:53:25,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:25,440 INFO L225 Difference]: With dead ends: 17199 [2019-12-07 13:53:25,441 INFO L226 Difference]: Without dead ends: 17199 [2019-12-07 13:53:25,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 143 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=448, Invalid=2102, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 13:53:25,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17199 states. [2019-12-07 13:53:25,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17199 to 16803. [2019-12-07 13:53:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16803 states. [2019-12-07 13:53:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16803 states to 16803 states and 23996 transitions. [2019-12-07 13:53:25,580 INFO L78 Accepts]: Start accepts. Automaton has 16803 states and 23996 transitions. Word has length 50 [2019-12-07 13:53:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:25,580 INFO L462 AbstractCegarLoop]: Abstraction has 16803 states and 23996 transitions. [2019-12-07 13:53:25,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 13:53:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 16803 states and 23996 transitions. [2019-12-07 13:53:25,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 13:53:25,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:25,581 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:25,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:25,782 INFO L410 AbstractCegarLoop]: === Iteration 22 === [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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:25,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:25,782 INFO L82 PathProgramCache]: Analyzing trace with hash 561908672, now seen corresponding path program 1 times [2019-12-07 13:53:25,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:53:25,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624372379] [2019-12-07 13:53:25,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 76 proven. 6 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-12-07 13:53:25,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624372379] [2019-12-07 13:53:25,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141123106] [2019-12-07 13:53:25,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:25,881 INFO L264 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 13:53:25,883 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-12-07 13:53:25,890 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-12-07 13:53:25,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1973749215] [2019-12-07 13:53:25,911 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 13:53:25,912 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:53:25,912 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:53:25,912 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:53:25,912 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:53:30,889 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:53:31,215 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-12-07 13:53:32,224 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:53:32,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:53:32,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2019-12-07 13:53:32,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035779968] [2019-12-07 13:53:32,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:53:32,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:53:32,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:53:32,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2019-12-07 13:53:32,225 INFO L87 Difference]: Start difference. First operand 16803 states and 23996 transitions. Second operand 9 states. [2019-12-07 13:53:32,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:32,323 INFO L93 Difference]: Finished difference Result 20313 states and 29054 transitions. [2019-12-07 13:53:32,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:53:32,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-12-07 13:53:32,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:32,337 INFO L225 Difference]: With dead ends: 20313 [2019-12-07 13:53:32,337 INFO L226 Difference]: Without dead ends: 20273 [2019-12-07 13:53:32,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2019-12-07 13:53:32,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20273 states. [2019-12-07 13:53:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20273 to 10682. [2019-12-07 13:53:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10682 states. [2019-12-07 13:53:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10682 states to 10682 states and 15196 transitions. [2019-12-07 13:53:32,451 INFO L78 Accepts]: Start accepts. Automaton has 10682 states and 15196 transitions. Word has length 60 [2019-12-07 13:53:32,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:32,451 INFO L462 AbstractCegarLoop]: Abstraction has 10682 states and 15196 transitions. [2019-12-07 13:53:32,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:53:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 10682 states and 15196 transitions. [2019-12-07 13:53:32,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 13:53:32,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:32,453 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 6, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:32,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:32,653 INFO L410 AbstractCegarLoop]: === Iteration 23 === [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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:32,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:32,654 INFO L82 PathProgramCache]: Analyzing trace with hash -83268450, now seen corresponding path program 2 times [2019-12-07 13:53:32,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:53:32,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012838542] [2019-12-07 13:53:32,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-12-07 13:53:32,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012838542] [2019-12-07 13:53:32,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527432281] [2019-12-07 13:53:32,722 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:32,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 13:53:32,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:53:32,770 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 13:53:32,772 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-12-07 13:53:32,810 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:32,842 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-12-07 13:53:32,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [290368187] [2019-12-07 13:53:32,843 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 13:53:32,843 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:53:32,843 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:53:32,843 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:53:32,844 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:53:37,899 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:53:38,247 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-12-07 13:53:39,301 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:53:39,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:53:39,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2019-12-07 13:53:39,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132047770] [2019-12-07 13:53:39,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 13:53:39,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:53:39,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 13:53:39,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2019-12-07 13:53:39,302 INFO L87 Difference]: Start difference. First operand 10682 states and 15196 transitions. Second operand 16 states. [2019-12-07 13:53:39,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:39,781 INFO L93 Difference]: Finished difference Result 13296 states and 17779 transitions. [2019-12-07 13:53:39,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 13:53:39,781 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2019-12-07 13:53:39,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:39,789 INFO L225 Difference]: With dead ends: 13296 [2019-12-07 13:53:39,789 INFO L226 Difference]: Without dead ends: 13296 [2019-12-07 13:53:39,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=475, Invalid=2717, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 13:53:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13296 states. [2019-12-07 13:53:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13296 to 6998. [2019-12-07 13:53:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6998 states. [2019-12-07 13:53:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6998 states to 6998 states and 9484 transitions. [2019-12-07 13:53:39,862 INFO L78 Accepts]: Start accepts. Automaton has 6998 states and 9484 transitions. Word has length 61 [2019-12-07 13:53:39,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:39,862 INFO L462 AbstractCegarLoop]: Abstraction has 6998 states and 9484 transitions. [2019-12-07 13:53:39,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 13:53:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 6998 states and 9484 transitions. [2019-12-07 13:53:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 13:53:39,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:39,864 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 6, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:40,064 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:40,065 INFO L410 AbstractCegarLoop]: === Iteration 24 === [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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:40,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:40,066 INFO L82 PathProgramCache]: Analyzing trace with hash -868486369, now seen corresponding path program 1 times [2019-12-07 13:53:40,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:53:40,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719727737] [2019-12-07 13:53:40,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:53:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:53:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:53:40,171 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 13:53:40,171 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:53:40,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:53:40 BoogieIcfgContainer [2019-12-07 13:53:40,238 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:53:40,239 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:53:40,239 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:53:40,239 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:53:40,239 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:52:12" (3/4) ... [2019-12-07 13:53:40,242 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 13:53:40,242 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:53:40,243 INFO L168 Benchmark]: Toolchain (without parser) took 88292.09 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 982.0 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -136.1 MB). Peak memory consumption was 845.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:53:40,243 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:53:40,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:53:40,243 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.50 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:53:40,243 INFO L168 Benchmark]: Boogie Preprocessor took 19.99 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 13:53:40,244 INFO L168 Benchmark]: RCFGBuilder took 367.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:53:40,244 INFO L168 Benchmark]: TraceAbstraction took 87537.63 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 847.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.6 MB). Peak memory consumption was 840.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:53:40,244 INFO L168 Benchmark]: Witness Printer took 3.49 ms. Allocated memory is still 2.0 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.2 kB). Peak memory consumption was 2.2 kB. Max. memory is 11.5 GB. [2019-12-07 13:53:40,244 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.50 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.99 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 367.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 87537.63 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 847.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.6 MB). Peak memory consumption was 840.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.49 ms. Allocated memory is still 2.0 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.2 kB). Peak memory consumption was 2.2 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 581]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 581. Possible FailurePath: [L517] struct cell *S; [L518] int pc1 = 1; [L519] int pc4 = 1; [L520] static struct cell *t1 = ((void *)0); [L521] static struct cell *x1 = ((void *)0); [L550] struct cell* garbage; [L551] static struct cell *t4 = ((void *)0); [L552] static struct cell *x4 = ((void *)0); [L555] static int res4; [L583] S || 1 != pc1 || __VERIFIER_nondet_int() [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L524] pc1++ [L525] case 1: [L526] x1 = malloc(sizeof(*x1)) VAL [garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L527] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L528] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L524] pc1++ [L525] case 1: [L530] case 2: VAL [garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L531] x1->data = 4 VAL [garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L524] pc1++ [L525] case 1: [L530] case 2: [L533] case 3: [L534] t1 = S VAL [garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L524] pc1++ [L525] case 1: [L530] case 2: [L533] case 3: [L536] case 4: VAL [garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L537] x1->next = t1 VAL [garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L524] pc1++ [L525] case 1: [L530] case 2: [L533] case 3: [L536] case 4: [L539] case 5: [L540] COND TRUE S == t1 [L541] S = x1 VAL [garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L524] pc1++ [L525] case 1: [L530] case 2: [L533] case 3: [L536] case 4: [L539] case 5: [L545] case 6: [L546] pc1 = 1 VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND FALSE !(__VERIFIER_nondet_int()) [L556] pc4++ [L557] case 1: [L558] t4 = S VAL [garbage={0:0}, pc1=1, pc4=2, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=2, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND FALSE !(__VERIFIER_nondet_int()) [L556] pc4++ [L557] case 1: [L560] case 2: [L561] COND FALSE !(t4 == ((void *)0)) VAL [garbage={0:0}, pc1=1, pc4=3, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=3, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND FALSE !(__VERIFIER_nondet_int()) [L556] pc4++ [L557] case 1: [L560] case 2: [L564] case 3: VAL [garbage={0:0}, pc1=1, pc4=4, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L565] EXPR t4->next [L565] x4 = t4->next [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=4, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND FALSE !(__VERIFIER_nondet_int()) [L556] pc4++ [L557] case 1: [L560] case 2: [L564] case 3: [L567] case 4: [L568] COND TRUE S == t4 [L569] S = x4 VAL [garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L583] S || 1 != pc1 || __VERIFIER_nondet_int() [L583] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L583] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L589] COND FALSE !(\read(*garbage)) [L594] S = ((void *)0) [L595] t1 = ((void *)0) [L596] x1 = ((void *)0) [L597] t4 = ((void *)0) [L598] x4 = ((void *)0) [L599] return !!garbage; VAL [garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 20 error locations. Result: UNSAFE, OverallTime: 87.4s, OverallIterations: 24, TraceHistogramMax: 11, AutomataDifference: 30.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2332 SDtfs, 9400 SDslu, 8777 SDs, 0 SdLazy, 5206 SolverSat, 989 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2124 GetRequests, 1376 SyntacticMatches, 46 SemanticMatches, 702 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28241 ImplicationChecksByTransitivity, 49.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16803occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 37320 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1078 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1431 ConstructedInterpolants, 0 QuantifiedInterpolants, 357751 SizeOfPredicates, 112 NumberOfNonLiveVariables, 2073 ConjunctsInSsa, 167 ConjunctsInUnsatCore, 51 InterpolantComputations, 9 PerfectInterpolantSequences, 1928/2482 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... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 13:53:41,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:53:41,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:53:41,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:53:41,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:53:41,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:53:41,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:53:41,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:53:41,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:53:41,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:53:41,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:53:41,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:53:41,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:53:41,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:53:41,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:53:41,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:53:41,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:53:41,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:53:41,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:53:41,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:53:41,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:53:41,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:53:41,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:53:41,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:53:41,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:53:41,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:53:41,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:53:41,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:53:41,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:53:41,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:53:41,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:53:41,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:53:41,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:53:41,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:53:41,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:53:41,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:53:41,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:53:41,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:53:41,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:53:41,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:53:41,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:53:41,611 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 13:53:41,624 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:53:41,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:53:41,625 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:53:41,626 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:53:41,626 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:53:41,626 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:53:41,626 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:53:41,626 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:53:41,627 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:53:41,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:53:41,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:53:41,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:53:41,628 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:53:41,628 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 13:53:41,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:53:41,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:53:41,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:53:41,629 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 13:53:41,629 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 13:53:41,629 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 13:53:41,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:53:41,629 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:53:41,630 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 13:53:41,630 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 13:53:41,630 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:53:41,630 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:53:41,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:53:41,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:53:41,631 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:53:41,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:53:41,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:53:41,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:53:41,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:53:41,632 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 13:53:41,632 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 13:53:41,632 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:53:41,632 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:53:41,633 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_f4d68466-42bb-4873-a043-643a8953e4fe/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 -> 9f2a2a3db64819077b17ec0cac240c138be80e0f [2019-12-07 13:53:41,792 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:53:41,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:53:41,802 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:53:41,803 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:53:41,803 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:53:41,804 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/../../sv-benchmarks/c/memsafety/lockfree-3.3.i [2019-12-07 13:53:41,841 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/data/6e6b5bc0c/ffc3f5b993ac4eb8919fc239ca3d5c8f/FLAG80c914791 [2019-12-07 13:53:42,283 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:53:42,283 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/sv-benchmarks/c/memsafety/lockfree-3.3.i [2019-12-07 13:53:42,293 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/data/6e6b5bc0c/ffc3f5b993ac4eb8919fc239ca3d5c8f/FLAG80c914791 [2019-12-07 13:53:42,622 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/data/6e6b5bc0c/ffc3f5b993ac4eb8919fc239ca3d5c8f [2019-12-07 13:53:42,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:53:42,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:53:42,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:53:42,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:53:42,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:53:42,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:53:42" (1/1) ... [2019-12-07 13:53:42,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e089cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:42, skipping insertion in model container [2019-12-07 13:53:42,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:53:42" (1/1) ... [2019-12-07 13:53:42,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:53:42,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:53:42,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:53:42,887 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:53:42,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:53:42,961 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:53:42,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:42 WrapperNode [2019-12-07 13:53:42,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:53:42,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:53:42,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:53:42,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:53:42,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:42" (1/1) ... [2019-12-07 13:53:42,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:42" (1/1) ... [2019-12-07 13:53:42,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:53:42,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:53:42,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:53:42,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:53:43,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:42" (1/1) ... [2019-12-07 13:53:43,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:42" (1/1) ... [2019-12-07 13:53:43,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:42" (1/1) ... [2019-12-07 13:53:43,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:42" (1/1) ... [2019-12-07 13:53:43,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:42" (1/1) ... [2019-12-07 13:53:43,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:42" (1/1) ... [2019-12-07 13:53:43,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:42" (1/1) ... [2019-12-07 13:53:43,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:53:43,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:53:43,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:53:43,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:53:43,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:53:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 13:53:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:53:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:53:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:53:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:53:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 13:53:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:53:43,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:53:43,360 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:53:43,360 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-12-07 13:53:43,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:53:43 BoogieIcfgContainer [2019-12-07 13:53:43,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:53:43,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:53:43,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:53:43,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:53:43,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:53:42" (1/3) ... [2019-12-07 13:53:43,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e2d95a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:53:43, skipping insertion in model container [2019-12-07 13:53:43,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:53:42" (2/3) ... [2019-12-07 13:53:43,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e2d95a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:53:43, skipping insertion in model container [2019-12-07 13:53:43,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:53:43" (3/3) ... [2019-12-07 13:53:43,368 INFO L109 eAbstractionObserver]: Analyzing ICFG lockfree-3.3.i [2019-12-07 13:53:43,377 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:53:43,383 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-12-07 13:53:43,391 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-12-07 13:53:43,404 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:53:43,404 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 13:53:43,404 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:53:43,404 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:53:43,404 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:53:43,404 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:53:43,404 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:53:43,404 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:53:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-12-07 13:53:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:53:43,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:43,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 13:53:43,420 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:43,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:43,424 INFO L82 PathProgramCache]: Analyzing trace with hash 28701576, now seen corresponding path program 1 times [2019-12-07 13:53:43,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:43,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303913230] [2019-12-07 13:53:43,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:53:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:43,477 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:53:43,480 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:43,506 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 13:53:43,506 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:43,508 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 13:53:43,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303913230] [2019-12-07 13:53:43,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:43,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 13:53:43,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973064322] [2019-12-07 13:53:43,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:53:43,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:43,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:53:43,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:53:43,524 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2019-12-07 13:53:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:43,575 INFO L93 Difference]: Finished difference Result 103 states and 135 transitions. [2019-12-07 13:53:43,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:53:43,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 13:53:43,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:43,585 INFO L225 Difference]: With dead ends: 103 [2019-12-07 13:53:43,585 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 13:53:43,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 13:53:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 13:53:43,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2019-12-07 13:53:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 13:53:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2019-12-07 13:53:43,615 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 5 [2019-12-07 13:53:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:43,615 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2019-12-07 13:53:43,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:53:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2019-12-07 13:53:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 13:53:43,616 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:43,616 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 13:53:43,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 13:53:43,817 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:43,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:43,818 INFO L82 PathProgramCache]: Analyzing trace with hash 889747453, now seen corresponding path program 1 times [2019-12-07 13:53:43,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:43,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899283571] [2019-12-07 13:53:43,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:53:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:43,891 INFO L264 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:53:43,892 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:43,900 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 13:53:43,901 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:43,903 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 13:53:43,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899283571] [2019-12-07 13:53:43,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:43,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 13:53:43,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184987514] [2019-12-07 13:53:43,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:53:43,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:43,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:53:43,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:53:43,907 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand 3 states. [2019-12-07 13:53:44,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:44,031 INFO L93 Difference]: Finished difference Result 155 states and 235 transitions. [2019-12-07 13:53:44,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:53:44,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 13:53:44,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:44,033 INFO L225 Difference]: With dead ends: 155 [2019-12-07 13:53:44,033 INFO L226 Difference]: Without dead ends: 152 [2019-12-07 13:53:44,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 13:53:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-07 13:53:44,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 132. [2019-12-07 13:53:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 13:53:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 221 transitions. [2019-12-07 13:53:44,044 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 221 transitions. Word has length 6 [2019-12-07 13:53:44,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:44,045 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 221 transitions. [2019-12-07 13:53:44,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:53:44,045 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 221 transitions. [2019-12-07 13:53:44,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 13:53:44,045 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:44,045 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 13:53:44,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 13:53:44,246 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:44,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:44,247 INFO L82 PathProgramCache]: Analyzing trace with hash 889692424, now seen corresponding path program 1 times [2019-12-07 13:53:44,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:44,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686947159] [2019-12-07 13:53:44,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:53:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:44,302 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:53:44,303 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:44,332 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:53:44,333 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:53:44,335 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:53:44,336 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:53:44,336 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 13:53:44,342 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 13:53:44,342 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:44,344 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 13:53:44,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686947159] [2019-12-07 13:53:44,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:44,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 13:53:44,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740009751] [2019-12-07 13:53:44,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:53:44,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:44,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:53:44,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:53:44,346 INFO L87 Difference]: Start difference. First operand 132 states and 221 transitions. Second operand 3 states. [2019-12-07 13:53:44,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:44,465 INFO L93 Difference]: Finished difference Result 199 states and 318 transitions. [2019-12-07 13:53:44,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:53:44,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 13:53:44,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:44,468 INFO L225 Difference]: With dead ends: 199 [2019-12-07 13:53:44,468 INFO L226 Difference]: Without dead ends: 199 [2019-12-07 13:53:44,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 13:53:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-12-07 13:53:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 178. [2019-12-07 13:53:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-12-07 13:53:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 304 transitions. [2019-12-07 13:53:44,483 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 304 transitions. Word has length 6 [2019-12-07 13:53:44,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:44,484 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 304 transitions. [2019-12-07 13:53:44,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:53:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 304 transitions. [2019-12-07 13:53:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 13:53:44,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:44,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 13:53:44,685 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 13:53:44,686 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:44,687 INFO L82 PathProgramCache]: Analyzing trace with hash 889692425, now seen corresponding path program 1 times [2019-12-07 13:53:44,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:44,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793635347] [2019-12-07 13:53:44,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:53:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:44,749 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:53:44,750 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:44,758 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:53:44,759 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:53:44,763 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:53:44,763 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:53:44,763 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:53:44,770 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 13:53:44,770 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:44,811 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 13:53:44,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793635347] [2019-12-07 13:53:44,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:44,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 13:53:44,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200310595] [2019-12-07 13:53:44,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:53:44,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:44,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:53:44,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:53:44,814 INFO L87 Difference]: Start difference. First operand 178 states and 304 transitions. Second operand 4 states. [2019-12-07 13:53:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:45,054 INFO L93 Difference]: Finished difference Result 262 states and 412 transitions. [2019-12-07 13:53:45,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:53:45,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 13:53:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:45,057 INFO L225 Difference]: With dead ends: 262 [2019-12-07 13:53:45,057 INFO L226 Difference]: Without dead ends: 262 [2019-12-07 13:53:45,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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 13:53:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-12-07 13:53:45,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 224. [2019-12-07 13:53:45,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-07 13:53:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 385 transitions. [2019-12-07 13:53:45,070 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 385 transitions. Word has length 6 [2019-12-07 13:53:45,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:45,070 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 385 transitions. [2019-12-07 13:53:45,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:53:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 385 transitions. [2019-12-07 13:53:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:53:45,071 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:45,071 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:45,271 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 13:53:45,272 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:45,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:45,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1810669365, now seen corresponding path program 1 times [2019-12-07 13:53:45,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:45,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624182621] [2019-12-07 13:53:45,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:53:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:45,327 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:53:45,328 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:45,338 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 13:53:45,338 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:45,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:45,343 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 13:53:45,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624182621] [2019-12-07 13:53:45,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:45,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 13:53:45,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149844301] [2019-12-07 13:53:45,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:53:45,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:45,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:53:45,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:53:45,344 INFO L87 Difference]: Start difference. First operand 224 states and 385 transitions. Second operand 4 states. [2019-12-07 13:53:45,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:45,381 INFO L93 Difference]: Finished difference Result 197 states and 290 transitions. [2019-12-07 13:53:45,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:53:45,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 13:53:45,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:45,382 INFO L225 Difference]: With dead ends: 197 [2019-12-07 13:53:45,382 INFO L226 Difference]: Without dead ends: 197 [2019-12-07 13:53:45,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 13:53:45,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-07 13:53:45,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 134. [2019-12-07 13:53:45,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-12-07 13:53:45,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 219 transitions. [2019-12-07 13:53:45,388 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 219 transitions. Word has length 7 [2019-12-07 13:53:45,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:45,388 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 219 transitions. [2019-12-07 13:53:45,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:53:45,388 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 219 transitions. [2019-12-07 13:53:45,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 13:53:45,389 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:45,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:45,589 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 13:53:45,590 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:45,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:45,591 INFO L82 PathProgramCache]: Analyzing trace with hash 346576936, now seen corresponding path program 1 times [2019-12-07 13:53:45,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:45,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147900659] [2019-12-07 13:53:45,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:53:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:45,641 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:53:45,642 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:45,650 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 13:53:45,650 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:45,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:45,653 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 13:53:45,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147900659] [2019-12-07 13:53:45,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:53:45,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 13:53:45,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366309197] [2019-12-07 13:53:45,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:53:45,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:45,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:53:45,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:53:45,655 INFO L87 Difference]: Start difference. First operand 134 states and 219 transitions. Second operand 4 states. [2019-12-07 13:53:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:45,681 INFO L93 Difference]: Finished difference Result 271 states and 417 transitions. [2019-12-07 13:53:45,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:53:45,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 13:53:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:45,683 INFO L225 Difference]: With dead ends: 271 [2019-12-07 13:53:45,684 INFO L226 Difference]: Without dead ends: 271 [2019-12-07 13:53:45,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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 13:53:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-07 13:53:45,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 178. [2019-12-07 13:53:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-12-07 13:53:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 288 transitions. [2019-12-07 13:53:45,691 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 288 transitions. Word has length 8 [2019-12-07 13:53:45,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:45,691 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 288 transitions. [2019-12-07 13:53:45,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:53:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 288 transitions. [2019-12-07 13:53:45,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:53:45,691 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:45,691 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:45,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 13:53:45,893 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:45,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:45,894 INFO L82 PathProgramCache]: Analyzing trace with hash 212840816, now seen corresponding path program 1 times [2019-12-07 13:53:45,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:45,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010397277] [2019-12-07 13:53:45,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:53:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:45,949 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:53:45,950 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:45,971 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:45,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:45,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010397277] [2019-12-07 13:53:45,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1501693632] [2019-12-07 13:53:45,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:53:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:46,040 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:53:46,041 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:46,043 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:46,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:46,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205137826] [2019-12-07 13:53:46,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:46,108 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 13:53:46,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:46,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:46,121 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:46,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:46,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:46,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:46,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 13:53:46,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 9 [2019-12-07 13:53:46,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658270079] [2019-12-07 13:53:46,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:53:46,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:46,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:53:46,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:53:46,147 INFO L87 Difference]: Start difference. First operand 178 states and 288 transitions. Second operand 10 states. [2019-12-07 13:53:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:46,320 INFO L93 Difference]: Finished difference Result 809 states and 1240 transitions. [2019-12-07 13:53:46,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 13:53:46,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-12-07 13:53:46,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:46,325 INFO L225 Difference]: With dead ends: 809 [2019-12-07 13:53:46,325 INFO L226 Difference]: Without dead ends: 809 [2019-12-07 13:53:46,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:53:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-12-07 13:53:46,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 388. [2019-12-07 13:53:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-07 13:53:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 645 transitions. [2019-12-07 13:53:46,335 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 645 transitions. Word has length 11 [2019-12-07 13:53:46,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:46,335 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 645 transitions. [2019-12-07 13:53:46,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:53:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 645 transitions. [2019-12-07 13:53:46,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:53:46,336 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:46,336 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:46,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk,8 mathsat -unsat_core_generation=3,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:46,938 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:46,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:46,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1598757208, now seen corresponding path program 1 times [2019-12-07 13:53:46,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:46,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528295919] [2019-12-07 13:53:46,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 13:53:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:46,975 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:53:46,976 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:46,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:46,982 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:46,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528295919] [2019-12-07 13:53:46,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [340208626] [2019-12-07 13:53:46,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:53:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:47,036 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:53:47,036 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:47,038 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:47,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962120685] [2019-12-07 13:53:47,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:47,074 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:53:47,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:47,077 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:47,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:47,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 13:53:47,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3, 3, 3] total 5 [2019-12-07 13:53:47,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037180366] [2019-12-07 13:53:47,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:53:47,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:47,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:53:47,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:53:47,081 INFO L87 Difference]: Start difference. First operand 388 states and 645 transitions. Second operand 6 states. [2019-12-07 13:53:47,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:47,119 INFO L93 Difference]: Finished difference Result 906 states and 1447 transitions. [2019-12-07 13:53:47,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:53:47,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-12-07 13:53:47,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:47,125 INFO L225 Difference]: With dead ends: 906 [2019-12-07 13:53:47,125 INFO L226 Difference]: Without dead ends: 906 [2019-12-07 13:53:47,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:53:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-12-07 13:53:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 882. [2019-12-07 13:53:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-12-07 13:53:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1447 transitions. [2019-12-07 13:53:47,145 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1447 transitions. Word has length 11 [2019-12-07 13:53:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:47,145 INFO L462 AbstractCegarLoop]: Abstraction has 882 states and 1447 transitions. [2019-12-07 13:53:47,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:53:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1447 transitions. [2019-12-07 13:53:47,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:53:47,146 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:47,146 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:47,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 mathsat -unsat_core_generation=3 [2019-12-07 13:53:47,749 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:47,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:47,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1435756047, now seen corresponding path program 1 times [2019-12-07 13:53:47,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:47,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578370372] [2019-12-07 13:53:47,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:53:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:47,812 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:53:47,814 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:47,840 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:47,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578370372] [2019-12-07 13:53:47,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1289484973] [2019-12-07 13:53:47,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:53:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:47,900 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:53:47,901 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:47,904 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:47,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342361430] [2019-12-07 13:53:47,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:47,939 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:53:47,940 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:47,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:47,942 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:47,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 13:53:47,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3, 3, 3] total 3 [2019-12-07 13:53:47,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951323306] [2019-12-07 13:53:47,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:53:47,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:47,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:53:47,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:53:47,946 INFO L87 Difference]: Start difference. First operand 882 states and 1447 transitions. Second operand 4 states. [2019-12-07 13:53:48,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:48,005 INFO L93 Difference]: Finished difference Result 1114 states and 1761 transitions. [2019-12-07 13:53:48,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:53:48,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 13:53:48,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:48,010 INFO L225 Difference]: With dead ends: 1114 [2019-12-07 13:53:48,010 INFO L226 Difference]: Without dead ends: 1114 [2019-12-07 13:53:48,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 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 13:53:48,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2019-12-07 13:53:48,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 993. [2019-12-07 13:53:48,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-12-07 13:53:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1583 transitions. [2019-12-07 13:53:48,027 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1583 transitions. Word has length 16 [2019-12-07 13:53:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:48,028 INFO L462 AbstractCegarLoop]: Abstraction has 993 states and 1583 transitions. [2019-12-07 13:53:48,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:53:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1583 transitions. [2019-12-07 13:53:48,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:53:48,029 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:48,029 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:48,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 mathsat -unsat_core_generation=3,15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:53:48,630 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:48,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:48,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1786470878, now seen corresponding path program 1 times [2019-12-07 13:53:48,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:48,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256743714] [2019-12-07 13:53:48,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 13:53:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:48,675 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:53:48,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:48,693 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:48,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:48,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256743714] [2019-12-07 13:53:48,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [751419000] [2019-12-07 13:53:48,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:53:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:48,757 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:53:48,758 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:48,761 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:48,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:48,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484564156] [2019-12-07 13:53:48,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:48,816 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 13:53:48,817 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:48,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:48,825 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:48,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:48,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:48,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 13:53:48,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 9 [2019-12-07 13:53:48,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869330820] [2019-12-07 13:53:48,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:53:48,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:48,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:53:48,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:53:48,850 INFO L87 Difference]: Start difference. First operand 993 states and 1583 transitions. Second operand 10 states. [2019-12-07 13:53:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:49,049 INFO L93 Difference]: Finished difference Result 1571 states and 2402 transitions. [2019-12-07 13:53:49,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 13:53:49,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-07 13:53:49,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:49,055 INFO L225 Difference]: With dead ends: 1571 [2019-12-07 13:53:49,055 INFO L226 Difference]: Without dead ends: 1571 [2019-12-07 13:53:49,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-12-07 13:53:49,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2019-12-07 13:53:49,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 954. [2019-12-07 13:53:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954 states. [2019-12-07 13:53:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1505 transitions. [2019-12-07 13:53:49,074 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1505 transitions. Word has length 19 [2019-12-07 13:53:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:49,075 INFO L462 AbstractCegarLoop]: Abstraction has 954 states and 1505 transitions. [2019-12-07 13:53:49,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:53:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1505 transitions. [2019-12-07 13:53:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:53:49,076 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:49,076 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:49,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:53:49,679 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:49,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:49,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1138871677, now seen corresponding path program 1 times [2019-12-07 13:53:49,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:49,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625849379] [2019-12-07 13:53:49,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/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 13:53:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:49,780 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 13:53:49,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 13:53:49,798 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:49,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 13:53:49,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625849379] [2019-12-07 13:53:49,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [677712599] [2019-12-07 13:53:49,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:53:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:49,880 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 13:53:49,881 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:49,884 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 13:53:49,885 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:49,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 13:53:49,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675846238] [2019-12-07 13:53:49,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:49,944 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:53:49,945 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 13:53:49,967 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:49,977 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 13:53:49,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 13:53:49,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5, 5, 5, 5] total 11 [2019-12-07 13:53:49,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456922176] [2019-12-07 13:53:49,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:53:49,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:49,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:53:49,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:53:49,979 INFO L87 Difference]: Start difference. First operand 954 states and 1505 transitions. Second operand 6 states. [2019-12-07 13:53:50,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:50,053 INFO L93 Difference]: Finished difference Result 1447 states and 2319 transitions. [2019-12-07 13:53:50,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:53:50,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 13:53:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:50,058 INFO L225 Difference]: With dead ends: 1447 [2019-12-07 13:53:50,059 INFO L226 Difference]: Without dead ends: 1447 [2019-12-07 13:53:50,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:53:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2019-12-07 13:53:50,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1435. [2019-12-07 13:53:50,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1435 states. [2019-12-07 13:53:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 2319 transitions. [2019-12-07 13:53:50,081 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 2319 transitions. Word has length 26 [2019-12-07 13:53:50,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:50,081 INFO L462 AbstractCegarLoop]: Abstraction has 1435 states and 2319 transitions. [2019-12-07 13:53:50,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:53:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2319 transitions. [2019-12-07 13:53:50,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:53:50,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:50,082 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:50,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:53:50,683 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:50,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:50,684 INFO L82 PathProgramCache]: Analyzing trace with hash -990026877, now seen corresponding path program 1 times [2019-12-07 13:53:50,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:50,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677979168] [2019-12-07 13:53:50,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 13:53:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:50,753 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 13:53:50,755 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:50,813 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:50,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:50,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:50,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:50,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:53:50,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:50,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677979168] [2019-12-07 13:53:50,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [652963323] [2019-12-07 13:53:50,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:53:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:51,001 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 13:53:51,002 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:51,017 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:51,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:51,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:51,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195423551] [2019-12-07 13:53:51,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:51,106 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 13:53:51,106 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 13:53:51,150 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:51,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:51,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:51,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:51,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:51,196 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 13:53:51,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 5 imperfect interpolant sequences. [2019-12-07 13:53:51,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 8, 7, 7, 7] total 24 [2019-12-07 13:53:51,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10675060] [2019-12-07 13:53:51,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:53:51,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:51,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:53:51,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2019-12-07 13:53:51,198 INFO L87 Difference]: Start difference. First operand 1435 states and 2319 transitions. Second operand 7 states. [2019-12-07 13:53:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:51,333 INFO L93 Difference]: Finished difference Result 2527 states and 4074 transitions. [2019-12-07 13:53:51,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:53:51,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-07 13:53:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:51,343 INFO L225 Difference]: With dead ends: 2527 [2019-12-07 13:53:51,343 INFO L226 Difference]: Without dead ends: 2527 [2019-12-07 13:53:51,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2019-12-07 13:53:51,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2527 states. [2019-12-07 13:53:51,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2527 to 1695. [2019-12-07 13:53:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1695 states. [2019-12-07 13:53:51,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2736 transitions. [2019-12-07 13:53:51,378 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2736 transitions. Word has length 26 [2019-12-07 13:53:51,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:51,378 INFO L462 AbstractCegarLoop]: Abstraction has 1695 states and 2736 transitions. [2019-12-07 13:53:51,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:53:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2736 transitions. [2019-12-07 13:53:51,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:53:51,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:51,379 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:51,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3,24 cvc4 --incremental --print-success --lang smt --rewrite-divk,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:51,982 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:51,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:51,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1139637279, now seen corresponding path program 2 times [2019-12-07 13:53:51,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:51,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954877183] [2019-12-07 13:53:51,984 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 13:53:52,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 13:53:52,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:53:52,036 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 13:53:52,036 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:52,056 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:52,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954877183] [2019-12-07 13:53:52,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1659701676] [2019-12-07 13:53:52,094 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:53:52,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 13:53:52,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:53:52,152 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 13:53:52,153 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:52,155 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:52,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874990068] [2019-12-07 13:53:52,159 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:52,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 13:53:52,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:53:52,199 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 13:53:52,199 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:52,245 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:52,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:52,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:52,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:52,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 13:53:52,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 13:53:52,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 9, 7] total 20 [2019-12-07 13:53:52,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001217048] [2019-12-07 13:53:52,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 13:53:52,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:52,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 13:53:52,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:53:52,294 INFO L87 Difference]: Start difference. First operand 1695 states and 2736 transitions. Second operand 20 states. [2019-12-07 13:53:52,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:53,000 INFO L93 Difference]: Finished difference Result 4858 states and 7508 transitions. [2019-12-07 13:53:53,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 13:53:53,000 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-12-07 13:53:53,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:53,016 INFO L225 Difference]: With dead ends: 4858 [2019-12-07 13:53:53,016 INFO L226 Difference]: Without dead ends: 4858 [2019-12-07 13:53:53,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=660, Invalid=1790, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 13:53:53,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4858 states. [2019-12-07 13:53:53,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4858 to 3320. [2019-12-07 13:53:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3320 states. [2019-12-07 13:53:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 5146 transitions. [2019-12-07 13:53:53,063 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 5146 transitions. Word has length 26 [2019-12-07 13:53:53,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:53,063 INFO L462 AbstractCegarLoop]: Abstraction has 3320 states and 5146 transitions. [2019-12-07 13:53:53,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 13:53:53,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 5146 transitions. [2019-12-07 13:53:53,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 13:53:53,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:53,064 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:53,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 cvc4 --incremental --print-success --lang smt --rewrite-divk,26 mathsat -unsat_core_generation=3 [2019-12-07 13:53:53,666 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:53,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:53,666 INFO L82 PathProgramCache]: Analyzing trace with hash -681445988, now seen corresponding path program 1 times [2019-12-07 13:53:53,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:53,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711805573] [2019-12-07 13:53:53,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 13:53:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:53,742 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 13:53:53,743 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:53,779 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:53,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:53,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711805573] [2019-12-07 13:53:53,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1797653488] [2019-12-07 13:53:53,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:53:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:53,856 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 13:53:53,856 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:53,863 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:53,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:53,875 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:53,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823128586] [2019-12-07 13:53:53,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:53,924 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 13:53:53,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:53,935 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:53,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:53,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:53:53,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 13:53:53,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 15 [2019-12-07 13:53:53,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687837432] [2019-12-07 13:53:53,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 13:53:53,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:53,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 13:53:53,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:53:53,992 INFO L87 Difference]: Start difference. First operand 3320 states and 5146 transitions. Second operand 16 states. [2019-12-07 13:53:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:54,560 INFO L93 Difference]: Finished difference Result 3936 states and 6039 transitions. [2019-12-07 13:53:54,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 13:53:54,561 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2019-12-07 13:53:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:54,576 INFO L225 Difference]: With dead ends: 3936 [2019-12-07 13:53:54,576 INFO L226 Difference]: Without dead ends: 3936 [2019-12-07 13:53:54,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 193 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=430, Invalid=1826, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 13:53:54,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2019-12-07 13:53:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 2863. [2019-12-07 13:53:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2863 states. [2019-12-07 13:53:54,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2863 states to 2863 states and 4416 transitions. [2019-12-07 13:53:54,606 INFO L78 Accepts]: Start accepts. Automaton has 2863 states and 4416 transitions. Word has length 36 [2019-12-07 13:53:54,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:54,607 INFO L462 AbstractCegarLoop]: Abstraction has 2863 states and 4416 transitions. [2019-12-07 13:53:54,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 13:53:54,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 4416 transitions. [2019-12-07 13:53:54,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 13:53:54,607 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:54,607 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:55,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt --rewrite-divk,29 mathsat -unsat_core_generation=3,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:55,210 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:55,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:55,210 INFO L82 PathProgramCache]: Analyzing trace with hash 812497874, now seen corresponding path program 1 times [2019-12-07 13:53:55,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:55,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002695572] [2019-12-07 13:53:55,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-12-07 13:53:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:55,272 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:53:55,273 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 13:53:55,281 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 13:53:55,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002695572] [2019-12-07 13:53:55,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [692537757] [2019-12-07 13:53:55,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:53:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:55,349 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:53:55,350 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 13:53:55,353 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 13:53:55,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339165621] [2019-12-07 13:53:55,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:55,402 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:53:55,403 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 13:53:55,406 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 13:53:55,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 13:53:55,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 4 [2019-12-07 13:53:55,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119716271] [2019-12-07 13:53:55,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:53:55,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:55,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:53:55,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:53:55,410 INFO L87 Difference]: Start difference. First operand 2863 states and 4416 transitions. Second operand 4 states. [2019-12-07 13:53:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:55,501 INFO L93 Difference]: Finished difference Result 5421 states and 8408 transitions. [2019-12-07 13:53:55,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:53:55,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-07 13:53:55,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:55,520 INFO L225 Difference]: With dead ends: 5421 [2019-12-07 13:53:55,520 INFO L226 Difference]: Without dead ends: 5421 [2019-12-07 13:53:55,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 257 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 13:53:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5421 states. [2019-12-07 13:53:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5421 to 4803. [2019-12-07 13:53:55,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4803 states. [2019-12-07 13:53:55,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4803 states to 4803 states and 7482 transitions. [2019-12-07 13:53:55,564 INFO L78 Accepts]: Start accepts. Automaton has 4803 states and 7482 transitions. Word has length 44 [2019-12-07 13:53:55,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:55,564 INFO L462 AbstractCegarLoop]: Abstraction has 4803 states and 7482 transitions. [2019-12-07 13:53:55,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:53:55,564 INFO L276 IsEmpty]: Start isEmpty. Operand 4803 states and 7482 transitions. [2019-12-07 13:53:55,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 13:53:55,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:55,565 INFO L410 BasicCegarLoop]: trace histogram [8, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:56,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:53:56,168 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:56,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:56,168 INFO L82 PathProgramCache]: Analyzing trace with hash -426383378, now seen corresponding path program 1 times [2019-12-07 13:53:56,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:56,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879783528] [2019-12-07 13:53:56,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2019-12-07 13:53:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:56,267 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:53:56,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:56,271 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:53:56,271 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:53:56,274 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:53:56,274 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:53:56,274 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 13:53:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 13:53:56,287 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 13:53:56,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879783528] [2019-12-07 13:53:56,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2074387714] [2019-12-07 13:53:56,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:53:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:56,392 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:53:56,393 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:56,396 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:53:56,396 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:53:56,397 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:53:56,397 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:53:56,397 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 13:53:56,402 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 13:53:56,402 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 13:53:56,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082220353] [2019-12-07 13:53:56,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:56,448 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:53:56,448 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:56,451 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:53:56,451 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:53:56,452 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:53:56,452 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:53:56,452 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 13:53:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 13:53:56,457 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 13:53:56,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 13:53:56,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 4 [2019-12-07 13:53:56,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117486556] [2019-12-07 13:53:56,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:53:56,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:56,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:53:56,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:53:56,465 INFO L87 Difference]: Start difference. First operand 4803 states and 7482 transitions. Second operand 5 states. [2019-12-07 13:53:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:56,777 INFO L93 Difference]: Finished difference Result 9250 states and 14275 transitions. [2019-12-07 13:53:56,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:53:56,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-07 13:53:56,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:56,791 INFO L225 Difference]: With dead ends: 9250 [2019-12-07 13:53:56,792 INFO L226 Difference]: Without dead ends: 9250 [2019-12-07 13:53:56,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 267 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:53:56,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9250 states. [2019-12-07 13:53:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9250 to 8484. [2019-12-07 13:53:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8484 states. [2019-12-07 13:53:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8484 states to 8484 states and 13204 transitions. [2019-12-07 13:53:56,881 INFO L78 Accepts]: Start accepts. Automaton has 8484 states and 13204 transitions. Word has length 46 [2019-12-07 13:53:56,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:56,881 INFO L462 AbstractCegarLoop]: Abstraction has 8484 states and 13204 transitions. [2019-12-07 13:53:56,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:53:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand 8484 states and 13204 transitions. [2019-12-07 13:53:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 13:53:56,882 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:56,882 INFO L410 BasicCegarLoop]: trace histogram [8, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:57,483 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3,37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:53:57,484 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:57,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:57,485 INFO L82 PathProgramCache]: Analyzing trace with hash -426383377, now seen corresponding path program 1 times [2019-12-07 13:53:57,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:57,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511721486] [2019-12-07 13:53:57,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/mathsat Starting monitored process 38 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with mathsat -unsat_core_generation=3 [2019-12-07 13:53:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:57,560 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 13:53:57,561 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:57,565 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:53:57,565 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:53:57,569 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:53:57,569 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:53:57,569 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:53:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 13:53:57,593 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 13:53:57,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511721486] [2019-12-07 13:53:57,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [806295674] [2019-12-07 13:53:57,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/cvc4 Starting monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:53:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:57,823 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 13:53:57,824 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:57,828 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:53:57,828 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:53:57,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:53:57,832 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:53:57,832 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:53:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 13:53:57,839 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 13:53:57,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169952750] [2019-12-07 13:53:57,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:57,891 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 13:53:57,892 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:57,896 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:53:57,896 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:53:57,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:53:57,900 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:53:57,900 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:53:57,908 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 13:53:57,909 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 13:53:57,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 13:53:57,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 7 [2019-12-07 13:53:57,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315586986] [2019-12-07 13:53:57,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:53:57,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:57,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:53:57,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:53:57,918 INFO L87 Difference]: Start difference. First operand 8484 states and 13204 transitions. Second operand 8 states. [2019-12-07 13:53:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:53:58,687 INFO L93 Difference]: Finished difference Result 13777 states and 20972 transitions. [2019-12-07 13:53:58,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:53:58,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-12-07 13:53:58,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:53:58,702 INFO L225 Difference]: With dead ends: 13777 [2019-12-07 13:53:58,703 INFO L226 Difference]: Without dead ends: 13777 [2019-12-07 13:53:58,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:53:58,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13777 states. [2019-12-07 13:53:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13777 to 12212. [2019-12-07 13:53:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12212 states. [2019-12-07 13:53:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12212 states to 12212 states and 18826 transitions. [2019-12-07 13:53:58,802 INFO L78 Accepts]: Start accepts. Automaton has 12212 states and 18826 transitions. Word has length 46 [2019-12-07 13:53:58,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:53:58,803 INFO L462 AbstractCegarLoop]: Abstraction has 12212 states and 18826 transitions. [2019-12-07 13:53:58,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:53:58,803 INFO L276 IsEmpty]: Start isEmpty. Operand 12212 states and 18826 transitions. [2019-12-07 13:53:58,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 13:53:58,804 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:53:58,804 INFO L410 BasicCegarLoop]: trace histogram [10, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:53:59,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 cvc4 --incremental --print-success --lang smt --rewrite-divk,38 mathsat -unsat_core_generation=3,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:59,406 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:53:59,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:53:59,407 INFO L82 PathProgramCache]: Analyzing trace with hash 456298912, now seen corresponding path program 1 times [2019-12-07 13:53:59,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:53:59,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435963004] [2019-12-07 13:53:59,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/mathsat Starting monitored process 41 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with mathsat -unsat_core_generation=3 [2019-12-07 13:53:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:59,511 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 13:53:59,512 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:59,534 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 41 proven. 30 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-12-07 13:53:59,534 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:59,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:59,544 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 41 proven. 30 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-12-07 13:53:59,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435963004] [2019-12-07 13:53:59,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1049361829] [2019-12-07 13:53:59,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/cvc4 Starting monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:53:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:59,614 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 13:53:59,615 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 41 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-07 13:53:59,640 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:59,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 41 proven. 30 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-12-07 13:53:59,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142977722] [2019-12-07 13:53:59,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:53:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:53:59,697 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 13:53:59,698 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:53:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 25 proven. 49 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-12-07 13:53:59,716 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:53:59,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:53:59,754 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 25 proven. 49 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-12-07 13:53:59,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 13:53:59,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8, 6, 6, 6] total 14 [2019-12-07 13:53:59,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423755560] [2019-12-07 13:53:59,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 13:53:59,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:53:59,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 13:53:59,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:53:59,755 INFO L87 Difference]: Start difference. First operand 12212 states and 18826 transitions. Second operand 15 states. [2019-12-07 13:54:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:54:00,137 INFO L93 Difference]: Finished difference Result 33133 states and 48848 transitions. [2019-12-07 13:54:00,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 13:54:00,138 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-07 13:54:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:54:00,168 INFO L225 Difference]: With dead ends: 33133 [2019-12-07 13:54:00,168 INFO L226 Difference]: Without dead ends: 33133 [2019-12-07 13:54:00,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 313 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 13:54:00,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33133 states. [2019-12-07 13:54:00,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33133 to 23542. [2019-12-07 13:54:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23542 states. [2019-12-07 13:54:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23542 states to 23542 states and 35496 transitions. [2019-12-07 13:54:00,416 INFO L78 Accepts]: Start accepts. Automaton has 23542 states and 35496 transitions. Word has length 56 [2019-12-07 13:54:00,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:54:00,416 INFO L462 AbstractCegarLoop]: Abstraction has 23542 states and 35496 transitions. [2019-12-07 13:54:00,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 13:54:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand 23542 states and 35496 transitions. [2019-12-07 13:54:00,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:54:00,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:54:00,418 INFO L410 BasicCegarLoop]: trace histogram [10, 6, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:54:01,020 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 mathsat -unsat_core_generation=3,42 cvc4 --incremental --print-success --lang smt --rewrite-divk,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:54:01,020 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.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:54:01,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:54:01,021 INFO L82 PathProgramCache]: Analyzing trace with hash 797221759, now seen corresponding path program 1 times [2019-12-07 13:54:01,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:54:01,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088153195] [2019-12-07 13:54:01,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4d68466-42bb-4873-a043-643a8953e4fe/bin/utaipan/mathsat Starting monitored process 44 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with mathsat -unsat_core_generation=3 [2019-12-07 13:54:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:54:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:54:01,240 INFO L174 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2019-12-07 13:54:01,240 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:54:01,441 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 mathsat -unsat_core_generation=3 [2019-12-07 13:54:01,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:54:01 BoogieIcfgContainer [2019-12-07 13:54:01,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:54:01,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:54:01,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:54:01,505 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:54:01,505 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:53:43" (3/4) ... [2019-12-07 13:54:01,508 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 13:54:01,508 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:54:01,509 INFO L168 Benchmark]: Toolchain (without parser) took 18881.56 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 354.4 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -139.8 MB). Peak memory consumption was 214.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:54:01,509 INFO L168 Benchmark]: CDTParser took 0.13 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 13:54:01,509 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -156.1 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:54:01,509 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:54:01,509 INFO L168 Benchmark]: Boogie Preprocessor took 23.54 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 13:54:01,509 INFO L168 Benchmark]: RCFGBuilder took 341.18 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: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:54:01,510 INFO L168 Benchmark]: TraceAbstraction took 18141.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 228.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -28.6 MB). Peak memory consumption was 199.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:54:01,510 INFO L168 Benchmark]: Witness Printer took 3.12 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:54:01,511 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 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -156.1 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.54 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 341.18 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: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18141.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 228.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -28.6 MB). Peak memory consumption was 199.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.12 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 581]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 581. Possible FailurePath: [L517] struct cell *S; [L518] int pc1 = 1; [L519] int pc4 = 1; [L520] static struct cell *t1 = ((void *)0); [L521] static struct cell *x1 = ((void *)0); [L550] struct cell* garbage; [L551] static struct cell *t4 = ((void *)0); [L552] static struct cell *x4 = ((void *)0); [L555] static int res4; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L524] pc1++ [L525] case 1: [L526] x1 = malloc(sizeof(*x1)) VAL [garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L527] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L528] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L524] pc1++ [L525] case 1: [L530] case 2: VAL [garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L531] x1->data = 4 VAL [garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L524] pc1++ [L525] case 1: [L530] case 2: [L533] case 3: [L534] t1 = S VAL [garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L524] pc1++ [L525] case 1: [L530] case 2: [L533] case 3: [L536] case 4: VAL [garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L537] x1->next = t1 VAL [garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L524] pc1++ [L525] case 1: [L530] case 2: [L533] case 3: [L536] case 4: [L539] case 5: VAL [garbage={0:0}, pc1=6, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L540] COND TRUE S == t1 [L541] S = x1 VAL [garbage={0:0}, pc1=6, pc4=1, res4=0, S={1:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND FALSE !(__VERIFIER_nondet_int()) [L556] pc4++ [L557] case 1: [L558] t4 = S VAL [garbage={0:0}, pc1=6, pc4=2, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND FALSE !(__VERIFIER_nondet_int()) [L556] pc4++ [L557] case 1: [L560] case 2: VAL [garbage={0:0}, pc1=6, pc4=3, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L561] COND FALSE !(t4 == ((void *)0)) VAL [garbage={0:0}, pc1=6, pc4=3, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND FALSE !(__VERIFIER_nondet_int()) [L556] pc4++ [L557] case 1: [L560] case 2: [L564] case 3: VAL [garbage={0:0}, pc1=6, pc4=4, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L565] EXPR t4->next VAL [garbage={0:0}, pc1=6, pc4=4, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L565] x4 = t4->next [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND FALSE !(__VERIFIER_nondet_int()) [L556] pc4++ [L557] case 1: [L560] case 2: [L564] case 3: [L567] case 4: VAL [garbage={0:0}, pc1=6, pc4=5, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L568] COND TRUE S == t4 [L569] S = x4 VAL [garbage={0:0}, pc1=6, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L583] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L584] COND TRUE __VERIFIER_nondet_int() [L524] pc1++ [L525] case 1: [L530] case 2: [L533] case 3: [L536] case 4: [L539] case 5: [L545] case 6: [L546] pc1 = 1 VAL [garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L583] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L589] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L594] S = ((void *)0) [L595] t1 = ((void *)0) [L596] x1 = ((void *)0) [L597] t4 = ((void *)0) [L598] x4 = ((void *)0) [L599] return !!garbage; VAL [garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 20 error locations. Result: UNSAFE, OverallTime: 18.0s, OverallIterations: 19, TraceHistogramMax: 10, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2370 SDtfs, 9996 SDslu, 8275 SDs, 0 SdLazy, 1753 SolverSat, 661 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2330 GetRequests, 2068 SyntacticMatches, 22 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23542occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 17431 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1193 NumberOfCodeBlocks, 1193 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2170 ConstructedInterpolants, 0 QuantifiedInterpolants, 384760 SizeOfPredicates, 157 NumberOfNonLiveVariables, 4238 ConjunctsInSsa, 295 ConjunctsInUnsatCore, 84 InterpolantComputations, 15 PerfectInterpolantSequences, 1702/2994 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...