./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/verifythis/duplets.c --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_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/duplets.c -s /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c261d11d6e37ef6eda45455c8074b5a0eac3352b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:11:42,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:11:42,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:11:42,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:11:42,131 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:11:42,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:11:42,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:11:42,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:11:42,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:11:42,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:11:42,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:11:42,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:11:42,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:11:42,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:11:42,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:11:42,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:11:42,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:11:42,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:11:42,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:11:42,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:11:42,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:11:42,145 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:11:42,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:11:42,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:11:42,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:11:42,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:11:42,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:11:42,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:11:42,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:11:42,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:11:42,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:11:42,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:11:42,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:11:42,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:11:42,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:11:42,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:11:42,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:11:42,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:11:42,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:11:42,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:11:42,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:11:42,153 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 13:11:42,162 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:11:42,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:11:42,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:11:42,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:11:42,163 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:11:42,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:11:42,164 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:11:42,164 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 13:11:42,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:11:42,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:11:42,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:11:42,164 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 13:11:42,164 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 13:11:42,165 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 13:11:42,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:11:42,165 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:11:42,165 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:11:42,165 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:11:42,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:11:42,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:11:42,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:11:42,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:11:42,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:11:42,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:11:42,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:11:42,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:11:42,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:11:42,166 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:11:42,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c261d11d6e37ef6eda45455c8074b5a0eac3352b [2019-12-07 13:11:42,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:11:42,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:11:42,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:11:42,278 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:11:42,279 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:11:42,279 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/../../sv-benchmarks/c/verifythis/duplets.c [2019-12-07 13:11:42,320 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/data/1abb73d65/a82f23e1827e4a1fa6860cb26a38ef8c/FLAG82849b58f [2019-12-07 13:11:42,752 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:11:42,752 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/sv-benchmarks/c/verifythis/duplets.c [2019-12-07 13:11:42,756 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/data/1abb73d65/a82f23e1827e4a1fa6860cb26a38ef8c/FLAG82849b58f [2019-12-07 13:11:42,765 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/data/1abb73d65/a82f23e1827e4a1fa6860cb26a38ef8c [2019-12-07 13:11:42,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:11:42,767 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 13:11:42,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:11:42,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:11:42,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:11:42,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:11:42" (1/1) ... [2019-12-07 13:11:42,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a0cc6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:11:42, skipping insertion in model container [2019-12-07 13:11:42,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:11:42" (1/1) ... [2019-12-07 13:11:42,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:11:42,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:11:42,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:11:42,946 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:11:42,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:11:42,979 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:11:42,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:11:42 WrapperNode [2019-12-07 13:11:42,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:11:42,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:11:42,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:11:42,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:11:42,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:11:42" (1/1) ... [2019-12-07 13:11:42,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:11:42" (1/1) ... [2019-12-07 13:11:42,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:11:42" (1/1) ... [2019-12-07 13:11:42,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:11:42" (1/1) ... [2019-12-07 13:11:43,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:11:42" (1/1) ... [2019-12-07 13:11:43,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:11:42" (1/1) ... [2019-12-07 13:11:43,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:11:42" (1/1) ... [2019-12-07 13:11:43,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:11:43,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:11:43,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:11:43,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:11:43,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:11:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:11:43,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 13:11:43,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:11:43,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-12-07 13:11:43,055 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2019-12-07 13:11:43,055 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2019-12-07 13:11:43,055 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 13:11:43,055 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-07 13:11:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 13:11:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 13:11:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 13:11:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-12-07 13:11:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 13:11:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-12-07 13:11:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2019-12-07 13:11:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:11:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2019-12-07 13:11:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 13:11:43,056 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 13:11:43,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:11:43,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:11:43,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-07 13:11:43,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:11:43,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 13:11:43,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:11:43,327 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:11:43,327 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-12-07 13:11:43,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:11:43 BoogieIcfgContainer [2019-12-07 13:11:43,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:11:43,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:11:43,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:11:43,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:11:43,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:11:42" (1/3) ... [2019-12-07 13:11:43,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b86f0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:11:43, skipping insertion in model container [2019-12-07 13:11:43,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:11:42" (2/3) ... [2019-12-07 13:11:43,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b86f0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:11:43, skipping insertion in model container [2019-12-07 13:11:43,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:11:43" (3/3) ... [2019-12-07 13:11:43,333 INFO L109 eAbstractionObserver]: Analyzing ICFG duplets.c [2019-12-07 13:11:43,339 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:11:43,344 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2019-12-07 13:11:43,351 INFO L249 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2019-12-07 13:11:43,363 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:11:43,363 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 13:11:43,363 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:11:43,363 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:11:43,363 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:11:43,364 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:11:43,364 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:11:43,364 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:11:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2019-12-07 13:11:43,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:11:43,383 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:43,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:43,384 INFO L410 AbstractCegarLoop]: === Iteration 1 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:43,387 INFO L82 PathProgramCache]: Analyzing trace with hash -115732399, now seen corresponding path program 1 times [2019-12-07 13:11:43,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:43,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945810290] [2019-12-07 13:11:43,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:43,569 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:11:43,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945810290] [2019-12-07 13:11:43,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:43,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:11:43,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958944748] [2019-12-07 13:11:43,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:11:43,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:43,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:11:43,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:11:43,585 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 8 states. [2019-12-07 13:11:43,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:43,960 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2019-12-07 13:11:43,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:11:43,962 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-07 13:11:43,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:43,972 INFO L225 Difference]: With dead ends: 103 [2019-12-07 13:11:43,972 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 13:11:43,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:11:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 13:11:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-12-07 13:11:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 13:11:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-12-07 13:11:44,009 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 14 [2019-12-07 13:11:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:44,009 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-12-07 13:11:44,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:11:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-12-07 13:11:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:11:44,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:44,010 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:44,010 INFO L410 AbstractCegarLoop]: === Iteration 2 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:44,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:44,010 INFO L82 PathProgramCache]: Analyzing trace with hash -115732398, now seen corresponding path program 1 times [2019-12-07 13:11:44,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:44,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945482939] [2019-12-07 13:11:44,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:44,102 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:11:44,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945482939] [2019-12-07 13:11:44,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:44,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:11:44,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136427721] [2019-12-07 13:11:44,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:11:44,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:44,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:11:44,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:11:44,105 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 8 states. [2019-12-07 13:11:44,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:44,415 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-12-07 13:11:44,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:11:44,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-07 13:11:44,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:44,417 INFO L225 Difference]: With dead ends: 99 [2019-12-07 13:11:44,417 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 13:11:44,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:11:44,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 13:11:44,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-12-07 13:11:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 13:11:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-12-07 13:11:44,425 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 14 [2019-12-07 13:11:44,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:44,426 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-12-07 13:11:44,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:11:44,426 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-12-07 13:11:44,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:11:44,426 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:44,426 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:44,427 INFO L410 AbstractCegarLoop]: === Iteration 3 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:44,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:44,427 INFO L82 PathProgramCache]: Analyzing trace with hash 707263019, now seen corresponding path program 1 times [2019-12-07 13:11:44,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:44,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808015457] [2019-12-07 13:11:44,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:44,510 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:11:44,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808015457] [2019-12-07 13:11:44,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:44,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:11:44,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401796602] [2019-12-07 13:11:44,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:11:44,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:44,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:11:44,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:11:44,512 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 8 states. [2019-12-07 13:11:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:44,813 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-12-07 13:11:44,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:11:44,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-12-07 13:11:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:44,814 INFO L225 Difference]: With dead ends: 98 [2019-12-07 13:11:44,814 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 13:11:44,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:11:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 13:11:44,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-12-07 13:11:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 13:11:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-12-07 13:11:44,822 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 15 [2019-12-07 13:11:44,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:44,823 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-12-07 13:11:44,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:11:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-12-07 13:11:44,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 13:11:44,824 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:44,824 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:44,824 INFO L410 AbstractCegarLoop]: === Iteration 4 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:44,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1976745985, now seen corresponding path program 1 times [2019-12-07 13:11:44,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:44,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451917932] [2019-12-07 13:11:44,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:11:44,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451917932] [2019-12-07 13:11:44,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:44,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:11:44,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793963109] [2019-12-07 13:11:44,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:11:44,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:44,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:11:44,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:11:44,911 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 8 states. [2019-12-07 13:11:45,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:45,147 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-12-07 13:11:45,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:11:45,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-12-07 13:11:45,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:45,149 INFO L225 Difference]: With dead ends: 96 [2019-12-07 13:11:45,149 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 13:11:45,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:11:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 13:11:45,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-12-07 13:11:45,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 13:11:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-12-07 13:11:45,155 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 23 [2019-12-07 13:11:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:45,155 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-12-07 13:11:45,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:11:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-12-07 13:11:45,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 13:11:45,156 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:45,156 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:45,156 INFO L410 AbstractCegarLoop]: === Iteration 5 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:45,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:45,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1976745986, now seen corresponding path program 1 times [2019-12-07 13:11:45,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:45,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545920794] [2019-12-07 13:11:45,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:45,289 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:11:45,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545920794] [2019-12-07 13:11:45,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:45,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 13:11:45,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701319867] [2019-12-07 13:11:45,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 13:11:45,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:45,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 13:11:45,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:11:45,291 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 11 states. [2019-12-07 13:11:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:45,860 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2019-12-07 13:11:45,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 13:11:45,861 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-07 13:11:45,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:45,862 INFO L225 Difference]: With dead ends: 116 [2019-12-07 13:11:45,862 INFO L226 Difference]: Without dead ends: 116 [2019-12-07 13:11:45,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:11:45,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-07 13:11:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2019-12-07 13:11:45,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 13:11:45,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2019-12-07 13:11:45,869 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 23 [2019-12-07 13:11:45,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:45,869 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2019-12-07 13:11:45,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 13:11:45,869 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2019-12-07 13:11:45,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 13:11:45,870 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:45,870 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:45,870 INFO L410 AbstractCegarLoop]: === Iteration 6 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:45,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:45,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1149583382, now seen corresponding path program 1 times [2019-12-07 13:11:45,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:45,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42307394] [2019-12-07 13:11:45,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:46,014 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:11:46,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42307394] [2019-12-07 13:11:46,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:46,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 13:11:46,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379955990] [2019-12-07 13:11:46,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:11:46,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:46,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:11:46,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:11:46,015 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 12 states. [2019-12-07 13:11:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:46,560 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2019-12-07 13:11:46,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 13:11:46,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-12-07 13:11:46,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:46,561 INFO L225 Difference]: With dead ends: 99 [2019-12-07 13:11:46,561 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 13:11:46,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-12-07 13:11:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 13:11:46,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-12-07 13:11:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 13:11:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-12-07 13:11:46,566 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 24 [2019-12-07 13:11:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:46,567 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-12-07 13:11:46,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:11:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-12-07 13:11:46,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:11:46,567 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:46,568 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:46,568 INFO L410 AbstractCegarLoop]: === Iteration 7 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:46,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:46,568 INFO L82 PathProgramCache]: Analyzing trace with hash 943033910, now seen corresponding path program 1 times [2019-12-07 13:11:46,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:46,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704796453] [2019-12-07 13:11:46,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:46,619 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:11:46,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704796453] [2019-12-07 13:11:46,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:46,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:11:46,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606614493] [2019-12-07 13:11:46,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:11:46,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:46,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:11:46,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:11:46,620 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 7 states. [2019-12-07 13:11:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:46,803 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-12-07 13:11:46,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:11:46,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-07 13:11:46,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:46,804 INFO L225 Difference]: With dead ends: 94 [2019-12-07 13:11:46,804 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 13:11:46,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:11:46,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 13:11:46,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-12-07 13:11:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 13:11:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2019-12-07 13:11:46,808 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 26 [2019-12-07 13:11:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:46,808 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2019-12-07 13:11:46,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:11:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2019-12-07 13:11:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:11:46,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:46,809 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:46,809 INFO L410 AbstractCegarLoop]: === Iteration 8 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:46,810 INFO L82 PathProgramCache]: Analyzing trace with hash 943033911, now seen corresponding path program 1 times [2019-12-07 13:11:46,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:46,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192745745] [2019-12-07 13:11:46,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:46,873 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:11:46,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192745745] [2019-12-07 13:11:46,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:46,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:11:46,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578027132] [2019-12-07 13:11:46,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:11:46,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:46,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:11:46,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:11:46,874 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 7 states. [2019-12-07 13:11:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:47,055 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2019-12-07 13:11:47,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:11:47,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-07 13:11:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:47,056 INFO L225 Difference]: With dead ends: 89 [2019-12-07 13:11:47,056 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 13:11:47,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:11:47,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 13:11:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-12-07 13:11:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 13:11:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-12-07 13:11:47,060 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 26 [2019-12-07 13:11:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:47,060 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-12-07 13:11:47,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:11:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-12-07 13:11:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:11:47,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:47,061 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:47,061 INFO L410 AbstractCegarLoop]: === Iteration 9 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:47,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:47,061 INFO L82 PathProgramCache]: Analyzing trace with hash 941830451, now seen corresponding path program 1 times [2019-12-07 13:11:47,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:47,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142674777] [2019-12-07 13:11:47,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:11:47,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142674777] [2019-12-07 13:11:47,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356987898] [2019-12-07 13:11:47,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:11:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,153 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:11:47,159 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:11:47,177 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:11:47,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 13:11:47,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 8 [2019-12-07 13:11:47,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404308261] [2019-12-07 13:11:47,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:11:47,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:47,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:11:47,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:11:47,179 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 5 states. [2019-12-07 13:11:47,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:47,222 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2019-12-07 13:11:47,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:11:47,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 13:11:47,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:47,224 INFO L225 Difference]: With dead ends: 112 [2019-12-07 13:11:47,225 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 13:11:47,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:11:47,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 13:11:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2019-12-07 13:11:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 13:11:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-12-07 13:11:47,231 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 26 [2019-12-07 13:11:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:47,231 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-12-07 13:11:47,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:11:47,232 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-12-07 13:11:47,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:11:47,233 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:47,233 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:47,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:11:47,434 INFO L410 AbstractCegarLoop]: === Iteration 10 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:47,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:47,434 INFO L82 PathProgramCache]: Analyzing trace with hash -830719863, now seen corresponding path program 1 times [2019-12-07 13:11:47,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:47,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379793776] [2019-12-07 13:11:47,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,487 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:11:47,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379793776] [2019-12-07 13:11:47,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:47,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:11:47,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729306714] [2019-12-07 13:11:47,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:11:47,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:47,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:11:47,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:11:47,488 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 7 states. [2019-12-07 13:11:47,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:47,667 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2019-12-07 13:11:47,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:11:47,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-12-07 13:11:47,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:47,668 INFO L225 Difference]: With dead ends: 88 [2019-12-07 13:11:47,668 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 13:11:47,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:11:47,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 13:11:47,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-12-07 13:11:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 13:11:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2019-12-07 13:11:47,673 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 27 [2019-12-07 13:11:47,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:47,674 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2019-12-07 13:11:47,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:11:47,674 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2019-12-07 13:11:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:11:47,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:47,675 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:47,675 INFO L410 AbstractCegarLoop]: === Iteration 11 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:47,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:47,675 INFO L82 PathProgramCache]: Analyzing trace with hash -830719862, now seen corresponding path program 1 times [2019-12-07 13:11:47,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:47,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056560638] [2019-12-07 13:11:47,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,731 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:11:47,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056560638] [2019-12-07 13:11:47,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:47,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:11:47,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112128184] [2019-12-07 13:11:47,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:11:47,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:47,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:11:47,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:11:47,732 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 7 states. [2019-12-07 13:11:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:47,912 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2019-12-07 13:11:47,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:11:47,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-12-07 13:11:47,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:47,913 INFO L225 Difference]: With dead ends: 83 [2019-12-07 13:11:47,913 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 13:11:47,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:11:47,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 13:11:47,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-12-07 13:11:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 13:11:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-12-07 13:11:47,917 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 27 [2019-12-07 13:11:47,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:47,917 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-12-07 13:11:47,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:11:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-12-07 13:11:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 13:11:47,918 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:47,918 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:47,918 INFO L410 AbstractCegarLoop]: === Iteration 12 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:47,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:47,919 INFO L82 PathProgramCache]: Analyzing trace with hash 48801308, now seen corresponding path program 1 times [2019-12-07 13:11:47,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:47,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345905524] [2019-12-07 13:11:47,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,969 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:11:47,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345905524] [2019-12-07 13:11:47,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976094063] [2019-12-07 13:11:47,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:11:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:48,005 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:11:48,006 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:11:48,011 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:11:48,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:11:48,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-12-07 13:11:48,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015391330] [2019-12-07 13:11:48,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:11:48,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:48,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:11:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:11:48,013 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 9 states. [2019-12-07 13:11:48,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:48,251 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2019-12-07 13:11:48,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 13:11:48,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-12-07 13:11:48,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:48,252 INFO L225 Difference]: With dead ends: 122 [2019-12-07 13:11:48,253 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 13:11:48,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:11:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 13:11:48,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 94. [2019-12-07 13:11:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 13:11:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2019-12-07 13:11:48,256 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 31 [2019-12-07 13:11:48,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:48,256 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2019-12-07 13:11:48,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:11:48,256 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2019-12-07 13:11:48,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 13:11:48,257 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:48,257 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:48,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:11:48,458 INFO L410 AbstractCegarLoop]: === Iteration 13 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:48,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:48,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1425745197, now seen corresponding path program 2 times [2019-12-07 13:11:48,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:48,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904354060] [2019-12-07 13:11:48,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:48,542 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:11:48,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904354060] [2019-12-07 13:11:48,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687394032] [2019-12-07 13:11:48,542 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:11:48,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 13:11:48,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:11:48,580 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 13:11:48,581 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:11:48,676 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:11:48,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:11:48,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-12-07 13:11:48,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813677931] [2019-12-07 13:11:48,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 13:11:48,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:48,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 13:11:48,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:11:48,677 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 17 states. [2019-12-07 13:11:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:49,523 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2019-12-07 13:11:49,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 13:11:49,524 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-12-07 13:11:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:49,525 INFO L225 Difference]: With dead ends: 123 [2019-12-07 13:11:49,525 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 13:11:49,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2019-12-07 13:11:49,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 13:11:49,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 81. [2019-12-07 13:11:49,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 13:11:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2019-12-07 13:11:49,528 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 36 [2019-12-07 13:11:49,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:49,528 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2019-12-07 13:11:49,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 13:11:49,529 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2019-12-07 13:11:49,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 13:11:49,530 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:49,530 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:49,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:11:49,731 INFO L410 AbstractCegarLoop]: === Iteration 14 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:49,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:49,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1630798574, now seen corresponding path program 1 times [2019-12-07 13:11:49,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:49,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27265283] [2019-12-07 13:11:49,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 13:11:49,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27265283] [2019-12-07 13:11:49,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186526931] [2019-12-07 13:11:49,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:11:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:49,843 INFO L264 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 13:11:49,845 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:11:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-07 13:11:49,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 13:11:49,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2019-12-07 13:11:49,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313626780] [2019-12-07 13:11:49,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:11:49,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:49,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:11:49,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:11:49,894 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 6 states. [2019-12-07 13:11:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:49,936 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2019-12-07 13:11:49,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:11:49,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-07 13:11:49,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:49,937 INFO L225 Difference]: With dead ends: 104 [2019-12-07 13:11:49,937 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 13:11:49,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:11:49,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 13:11:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. [2019-12-07 13:11:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 13:11:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-12-07 13:11:49,941 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 58 [2019-12-07 13:11:49,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:49,941 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-12-07 13:11:49,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:11:49,941 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-12-07 13:11:49,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 13:11:49,942 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:49,942 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:50,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:11:50,143 INFO L410 AbstractCegarLoop]: === Iteration 15 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:50,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:50,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1652012609, now seen corresponding path program 1 times [2019-12-07 13:11:50,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:50,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677054487] [2019-12-07 13:11:50,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 13:11:50,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677054487] [2019-12-07 13:11:50,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986559313] [2019-12-07 13:11:50,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:11:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,245 INFO L264 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 13:11:50,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:11:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 13:11:50,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 13:11:50,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 9 [2019-12-07 13:11:50,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655524373] [2019-12-07 13:11:50,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:11:50,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:50,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:11:50,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:11:50,259 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 7 states. [2019-12-07 13:11:50,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:50,294 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2019-12-07 13:11:50,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:11:50,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-12-07 13:11:50,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:50,295 INFO L225 Difference]: With dead ends: 86 [2019-12-07 13:11:50,295 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 13:11:50,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:11:50,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 13:11:50,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-12-07 13:11:50,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 13:11:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-12-07 13:11:50,297 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 61 [2019-12-07 13:11:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:50,298 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-12-07 13:11:50,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:11:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2019-12-07 13:11:50,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 13:11:50,298 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:50,299 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:50,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:11:50,499 INFO L410 AbstractCegarLoop]: === Iteration 16 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:50,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:50,500 INFO L82 PathProgramCache]: Analyzing trace with hash -35663204, now seen corresponding path program 1 times [2019-12-07 13:11:50,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:50,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110884672] [2019-12-07 13:11:50,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,611 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-07 13:11:50,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110884672] [2019-12-07 13:11:50,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:50,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 13:11:50,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198388092] [2019-12-07 13:11:50,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:11:50,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:50,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:11:50,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:11:50,613 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 12 states. [2019-12-07 13:11:50,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:50,929 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-12-07 13:11:50,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 13:11:50,930 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-07 13:11:50,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:50,930 INFO L225 Difference]: With dead ends: 76 [2019-12-07 13:11:50,930 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 13:11:50,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-07 13:11:50,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 13:11:50,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-12-07 13:11:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 13:11:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-12-07 13:11:50,933 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 64 [2019-12-07 13:11:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:50,935 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-12-07 13:11:50,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:11:50,935 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-12-07 13:11:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:11:50,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:50,935 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:50,936 INFO L410 AbstractCegarLoop]: === Iteration 17 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:50,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:50,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1633609241, now seen corresponding path program 1 times [2019-12-07 13:11:50,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:50,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835663422] [2019-12-07 13:11:50,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 13:11:51,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835663422] [2019-12-07 13:11:51,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088822729] [2019-12-07 13:11:51,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:11:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,138 INFO L264 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:11:51,140 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:11:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 13:11:51,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 13:11:51,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 16 [2019-12-07 13:11:51,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905840178] [2019-12-07 13:11:51,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:11:51,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:51,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:11:51,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:11:51,157 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 5 states. [2019-12-07 13:11:51,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:51,182 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-12-07 13:11:51,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:11:51,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 13:11:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:51,183 INFO L225 Difference]: With dead ends: 76 [2019-12-07 13:11:51,183 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 13:11:51,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:11:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 13:11:51,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-12-07 13:11:51,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 13:11:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-12-07 13:11:51,186 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 66 [2019-12-07 13:11:51,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:51,186 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-12-07 13:11:51,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:11:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-12-07 13:11:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 13:11:51,187 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:51,187 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:51,387 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:11:51,388 INFO L410 AbstractCegarLoop]: === Iteration 18 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:51,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:51,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1616930628, now seen corresponding path program 1 times [2019-12-07 13:11:51,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:51,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375340016] [2019-12-07 13:11:51,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 13:11:51,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375340016] [2019-12-07 13:11:51,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819996678] [2019-12-07 13:11:51,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:11:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:51,941 INFO L264 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 13:11:51,943 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:11:51,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 13:11:51,999 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:11:52,004 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:11:52,004 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:11:52,004 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 13:11:52,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 13:11:52,103 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:11:52,109 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:11:52,110 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:11:52,110 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-07 13:11:52,149 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:11:52,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 [2019-12-07 13:11:52,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:11:52,151 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:11:52,169 INFO L614 ElimStorePlain]: treesize reduction 16, result has 68.6 percent of original size [2019-12-07 13:11:52,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:11:52,171 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:11:52,171 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:36 [2019-12-07 13:11:52,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:11:52,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:11:52,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:11:52,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:11:52,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:11:52,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2019-12-07 13:11:52,907 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:11:52,912 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:11:52,912 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:11:52,912 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:20 [2019-12-07 13:11:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 13:11:52,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 13:11:52,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [21] total 36 [2019-12-07 13:11:52,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774083424] [2019-12-07 13:11:52,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 13:11:52,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:52,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 13:11:52,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 13:11:52,975 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 17 states. [2019-12-07 13:11:55,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:55,670 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-12-07 13:11:55,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 13:11:55,670 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-12-07 13:11:55,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:55,670 INFO L225 Difference]: With dead ends: 78 [2019-12-07 13:11:55,671 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 13:11:55,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=236, Invalid=2116, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 13:11:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 13:11:55,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-12-07 13:11:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 13:11:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-12-07 13:11:55,674 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 68 [2019-12-07 13:11:55,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:55,674 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-12-07 13:11:55,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 13:11:55,674 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-12-07 13:11:55,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 13:11:55,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:55,675 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:55,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:11:55,875 INFO L410 AbstractCegarLoop]: === Iteration 19 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:55,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:55,876 INFO L82 PathProgramCache]: Analyzing trace with hash 907828895, now seen corresponding path program 1 times [2019-12-07 13:11:55,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:55,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720078857] [2019-12-07 13:11:55,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-07 13:11:56,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720078857] [2019-12-07 13:11:56,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:56,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 13:11:56,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040553751] [2019-12-07 13:11:56,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:11:56,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:56,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:11:56,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:11:56,051 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 13 states. [2019-12-07 13:11:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:56,551 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2019-12-07 13:11:56,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 13:11:56,551 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-12-07 13:11:56,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:56,552 INFO L225 Difference]: With dead ends: 126 [2019-12-07 13:11:56,552 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 13:11:56,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-07 13:11:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 13:11:56,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2019-12-07 13:11:56,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-07 13:11:56,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2019-12-07 13:11:56,556 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 70 [2019-12-07 13:11:56,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:56,557 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2019-12-07 13:11:56,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 13:11:56,557 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2019-12-07 13:11:56,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 13:11:56,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:56,558 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:56,558 INFO L410 AbstractCegarLoop]: === Iteration 20 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:56,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:56,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1554600484, now seen corresponding path program 1 times [2019-12-07 13:11:56,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:56,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033598014] [2019-12-07 13:11:56,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 13:11:56,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033598014] [2019-12-07 13:11:56,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376097600] [2019-12-07 13:11:56,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:11:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:56,928 INFO L264 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 13:11:56,930 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:11:56,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-12-07 13:11:56,950 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:11:56,952 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:11:56,952 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:11:56,953 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-12-07 13:11:57,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-12-07 13:11:57,006 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:11:57,007 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:11:57,007 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:11:57,007 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-12-07 13:11:57,085 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-12-07 13:11:57,085 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-12-07 13:11:57,085 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:11:57,092 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:11:57,092 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 13:11:57,092 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-12-07 13:11:57,181 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-12-07 13:11:57,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-12-07 13:11:57,182 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:11:57,190 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:11:57,190 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 13:11:57,190 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-12-07 13:11:57,269 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-12-07 13:11:57,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-12-07 13:11:57,270 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:11:57,276 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:11:57,277 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 13:11:57,277 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-12-07 13:11:57,363 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-12-07 13:11:57,363 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-12-07 13:11:57,364 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:11:57,370 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:11:57,371 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 13:11:57,371 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-12-07 13:11:57,450 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-12-07 13:11:57,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-12-07 13:11:57,451 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:11:57,457 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:11:57,457 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 13:11:57,457 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-12-07 13:11:57,557 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-12-07 13:11:57,557 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-12-07 13:11:57,558 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:11:57,566 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:11:57,567 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 13:11:57,567 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-12-07 13:11:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 13:11:57,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 13:11:57,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-12-07 13:11:57,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793004583] [2019-12-07 13:11:57,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:11:57,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:57,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:11:57,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-12-07 13:11:57,698 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 9 states. [2019-12-07 13:11:58,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:58,062 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-12-07 13:11:58,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:11:58,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-12-07 13:11:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:58,064 INFO L225 Difference]: With dead ends: 118 [2019-12-07 13:11:58,064 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 13:11:58,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 15 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-12-07 13:11:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 13:11:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-12-07 13:11:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 13:11:58,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2019-12-07 13:11:58,070 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 80 [2019-12-07 13:11:58,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:58,070 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2019-12-07 13:11:58,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:11:58,070 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2019-12-07 13:11:58,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 13:11:58,072 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:58,072 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:58,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:11:58,273 INFO L410 AbstractCegarLoop]: === Iteration 21 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 13:11:58,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:58,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1047974994, now seen corresponding path program 1 times [2019-12-07 13:11:58,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:11:58,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348705218] [2019-12-07 13:11:58,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-07 13:11:58,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348705218] [2019-12-07 13:11:58,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723411917] [2019-12-07 13:11:58,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:11:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:58,591 INFO L264 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 13:11:58,592 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:11:58,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 13:11:58,827 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:11:58,833 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:11:58,833 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:11:58,833 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2019-12-07 13:11:59,373 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-12-07 13:11:59,373 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:11:59,378 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:11:59,379 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:11:59,379 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-12-07 13:11:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-07 13:11:59,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:11:59,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30 [2019-12-07 13:11:59,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525175198] [2019-12-07 13:11:59,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 13:11:59,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:11:59,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 13:11:59,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2019-12-07 13:11:59,446 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 31 states. [2019-12-07 13:12:05,734 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-07 13:12:06,607 WARN L192 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-12-07 13:12:07,513 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-07 13:12:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:12:08,108 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2019-12-07 13:12:08,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 13:12:08,109 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 83 [2019-12-07 13:12:08,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:12:08,109 INFO L225 Difference]: With dead ends: 117 [2019-12-07 13:12:08,109 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 13:12:08,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=458, Invalid=3448, Unknown=0, NotChecked=0, Total=3906 [2019-12-07 13:12:08,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 13:12:08,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 13:12:08,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 13:12:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 13:12:08,110 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2019-12-07 13:12:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:12:08,111 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 13:12:08,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 13:12:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 13:12:08,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 13:12:08,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:12:08,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:12:08 BoogieIcfgContainer [2019-12-07 13:12:08,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:12:08,318 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:12:08,318 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:12:08,318 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:12:08,318 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:11:43" (3/4) ... [2019-12-07 13:12:08,320 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 13:12:08,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 13:12:08,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mkdup [2019-12-07 13:12:08,325 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure finddup [2019-12-07 13:12:08,325 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 13:12:08,325 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-12-07 13:12:08,325 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-12-07 13:12:08,330 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-12-07 13:12:08,330 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 13:12:08,330 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 13:12:08,330 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 13:12:08,365 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_55e8f9c0-27f7-49e8-9899-33f709a9b277/bin/uautomizer/witness.graphml [2019-12-07 13:12:08,365 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:12:08,366 INFO L168 Benchmark]: Toolchain (without parser) took 25598.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.0 MB). Free memory was 943.5 MB in the beginning and 1.0 GB in the end (delta: -105.5 MB). Peak memory consumption was 132.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:12:08,366 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:12:08,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:12:08,367 INFO L168 Benchmark]: Boogie Preprocessor took 32.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:12:08,367 INFO L168 Benchmark]: RCFGBuilder took 315.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:12:08,367 INFO L168 Benchmark]: TraceAbstraction took 24988.54 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.9 MB). Peak memory consumption was 142.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:12:08,367 INFO L168 Benchmark]: Witness Printer took 47.60 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:12:08,368 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 212.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 315.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24988.54 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.9 MB). Peak memory consumption was 142.8 MB. Max. memory is 11.5 GB. * Witness Printer took 47.60 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 106 locations, 36 error locations. Result: SAFE, OverallTime: 24.9s, OverallIterations: 21, TraceHistogramMax: 5, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1220 SDtfs, 2611 SDslu, 3582 SDs, 0 SdLazy, 7643 SolverSat, 799 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1030 GetRequests, 616 SyntacticMatches, 33 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2184 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 155 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1341 ConstructedInterpolants, 134 QuantifiedInterpolants, 833189 SizeOfPredicates, 48 NumberOfNonLiveVariables, 2156 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 341/444 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...