./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b9946a15-bcbd-4deb-9705-6d57ceb9d134/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b9946a15-bcbd-4deb-9705-6d57ceb9d134/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b9946a15-bcbd-4deb-9705-6d57ceb9d134/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b9946a15-bcbd-4deb-9705-6d57ceb9d134/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b9946a15-bcbd-4deb-9705-6d57ceb9d134/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b9946a15-bcbd-4deb-9705-6d57ceb9d134/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f270b702de634d3ad2ee5a400388c6410a4cf10 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memtrack) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:29:32,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:29:32,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:29:32,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:29:32,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:29:32,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:29:32,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:29:32,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:29:32,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:29:32,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:29:32,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:29:32,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:29:32,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:29:32,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:29:32,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:29:32,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:29:32,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:29:32,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:29:32,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:29:32,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:29:32,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:29:32,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:29:32,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:29:32,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:29:32,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:29:32,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:29:32,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:29:32,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:29:32,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:29:32,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:29:32,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:29:32,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:29:32,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:29:32,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:29:32,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:29:32,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:29:32,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:29:32,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:29:32,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:29:32,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:29:32,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:29:32,660 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b9946a15-bcbd-4deb-9705-6d57ceb9d134/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 11:29:32,674 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:29:32,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:29:32,674 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:29:32,675 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:29:32,675 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:29:32,675 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:29:32,675 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:29:32,675 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:29:32,676 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:29:32,676 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:29:32,676 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:29:32,676 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:29:32,676 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:29:32,677 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:29:32,677 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:29:32,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:29:32,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:29:32,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:29:32,678 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:29:32,678 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:29:32,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:29:32,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:29:32,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:29:32,679 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 11:29:32,679 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 11:29:32,679 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 11:29:32,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:29:32,679 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:29:32,680 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:29:32,680 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:29:32,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:29:32,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:29:32,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:29:32,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:29:32,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:29:32,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:29:32,681 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:29:32,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:29:32,681 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:29:32,681 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:29:32,681 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_b9946a15-bcbd-4deb-9705-6d57ceb9d134/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f270b702de634d3ad2ee5a400388c6410a4cf10 [2019-12-07 11:29:32,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:29:32,799 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:29:32,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:29:32,803 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:29:32,803 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:29:32,804 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b9946a15-bcbd-4deb-9705-6d57ceb9d134/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2019-12-07 11:29:32,845 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b9946a15-bcbd-4deb-9705-6d57ceb9d134/bin/utaipan/data/d2444e2a8/1848d1f2849e48d68de46cf67721e7cb/FLAG7a17b005f [2019-12-07 11:29:33,296 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:29:33,297 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b9946a15-bcbd-4deb-9705-6d57ceb9d134/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2019-12-07 11:29:33,306 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b9946a15-bcbd-4deb-9705-6d57ceb9d134/bin/utaipan/data/d2444e2a8/1848d1f2849e48d68de46cf67721e7cb/FLAG7a17b005f [2019-12-07 11:29:33,314 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b9946a15-bcbd-4deb-9705-6d57ceb9d134/bin/utaipan/data/d2444e2a8/1848d1f2849e48d68de46cf67721e7cb [2019-12-07 11:29:33,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:29:33,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:29:33,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:29:33,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:29:33,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:29:33,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:29:33" (1/1) ... [2019-12-07 11:29:33,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61040381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:33, skipping insertion in model container [2019-12-07 11:29:33,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:29:33" (1/1) ... [2019-12-07 11:29:33,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:29:33,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:29:33,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:29:33,584 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:29:33,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:29:33,648 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:29:33,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:33 WrapperNode [2019-12-07 11:29:33,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:29:33,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:29:33,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:29:33,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:29:33,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:33" (1/1) ... [2019-12-07 11:29:33,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:33" (1/1) ... [2019-12-07 11:29:33,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:29:33,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:29:33,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:29:33,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:29:33,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:33" (1/1) ... [2019-12-07 11:29:33,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:33" (1/1) ... [2019-12-07 11:29:33,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:33" (1/1) ... [2019-12-07 11:29:33,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:33" (1/1) ... [2019-12-07 11:29:33,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:33" (1/1) ... [2019-12-07 11:29:33,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:33" (1/1) ... [2019-12-07 11:29:33,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:33" (1/1) ... [2019-12-07 11:29:33,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:29:33,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:29:33,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:29:33,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:29:33,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9946a15-bcbd-4deb-9705-6d57ceb9d134/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:29:33,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:29:33,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:29:33,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:29:33,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 11:29:33,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 11:29:33,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:29:33,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:29:33,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:29:34,136 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:29:34,136 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 11:29:34,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:29:34 BoogieIcfgContainer [2019-12-07 11:29:34,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:29:34,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:29:34,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:29:34,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:29:34,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:29:33" (1/3) ... [2019-12-07 11:29:34,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dff778c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:29:34, skipping insertion in model container [2019-12-07 11:29:34,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:33" (2/3) ... [2019-12-07 11:29:34,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dff778c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:29:34, skipping insertion in model container [2019-12-07 11:29:34,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:29:34" (3/3) ... [2019-12-07 11:29:34,142 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2019-12-07 11:29:34,149 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:29:34,154 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2019-12-07 11:29:34,163 INFO L249 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2019-12-07 11:29:34,177 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:29:34,177 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 11:29:34,177 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:29:34,177 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:29:34,177 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:29:34,177 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:29:34,177 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:29:34,177 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:29:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2019-12-07 11:29:34,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 11:29:34,197 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:34,197 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 11:29:34,198 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:29:34,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:34,202 INFO L82 PathProgramCache]: Analyzing trace with hash 8126, now seen corresponding path program 1 times [2019-12-07 11:29:34,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:29:34,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199315926] [2019-12-07 11:29:34,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:34,307 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 11:29:34,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199315926] [2019-12-07 11:29:34,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:34,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:29:34,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28079582] [2019-12-07 11:29:34,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:29:34,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:29:34,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:29:34,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:29:34,328 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 3 states. [2019-12-07 11:29:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:34,452 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2019-12-07 11:29:34,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:29:34,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 11:29:34,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:34,461 INFO L225 Difference]: With dead ends: 119 [2019-12-07 11:29:34,461 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 11:29:34,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:29:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 11:29:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-12-07 11:29:34,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 11:29:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2019-12-07 11:29:34,491 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 2 [2019-12-07 11:29:34,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:34,491 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2019-12-07 11:29:34,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:29:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2019-12-07 11:29:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 11:29:34,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:34,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 11:29:34,492 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:29:34,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:34,493 INFO L82 PathProgramCache]: Analyzing trace with hash 8127, now seen corresponding path program 1 times [2019-12-07 11:29:34,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:29:34,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245663551] [2019-12-07 11:29:34,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:34,518 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 11:29:34,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245663551] [2019-12-07 11:29:34,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:34,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:29:34,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755036421] [2019-12-07 11:29:34,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:29:34,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:29:34,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:29:34,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:29:34,520 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 3 states. [2019-12-07 11:29:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:34,614 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2019-12-07 11:29:34,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:29:34,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 11:29:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:34,615 INFO L225 Difference]: With dead ends: 127 [2019-12-07 11:29:34,615 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 11:29:34,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:29:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 11:29:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 116. [2019-12-07 11:29:34,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 11:29:34,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2019-12-07 11:29:34,623 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 2 [2019-12-07 11:29:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:34,623 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2019-12-07 11:29:34,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:29:34,623 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2019-12-07 11:29:34,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:29:34,623 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:34,623 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:34,624 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:29:34,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:34,624 INFO L82 PathProgramCache]: Analyzing trace with hash 696147154, now seen corresponding path program 1 times [2019-12-07 11:29:34,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:29:34,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081565302] [2019-12-07 11:29:34,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:34,670 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 11:29:34,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081565302] [2019-12-07 11:29:34,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:34,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:29:34,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494867972] [2019-12-07 11:29:34,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:34,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:29:34,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:34,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:34,672 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 4 states. [2019-12-07 11:29:34,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:34,788 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2019-12-07 11:29:34,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:29:34,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 11:29:34,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:34,789 INFO L225 Difference]: With dead ends: 117 [2019-12-07 11:29:34,789 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 11:29:34,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:29:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 11:29:34,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2019-12-07 11:29:34,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 11:29:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2019-12-07 11:29:34,795 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 7 [2019-12-07 11:29:34,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:34,795 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2019-12-07 11:29:34,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2019-12-07 11:29:34,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:29:34,795 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:34,795 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:34,796 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:29:34,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:34,796 INFO L82 PathProgramCache]: Analyzing trace with hash 696147155, now seen corresponding path program 1 times [2019-12-07 11:29:34,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:29:34,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310953384] [2019-12-07 11:29:34,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:34,856 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 11:29:34,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310953384] [2019-12-07 11:29:34,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:34,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:29:34,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608492115] [2019-12-07 11:29:34,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:34,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:29:34,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:34,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:34,858 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 4 states. [2019-12-07 11:29:34,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:34,999 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2019-12-07 11:29:35,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:35,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 11:29:35,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:35,001 INFO L225 Difference]: With dead ends: 140 [2019-12-07 11:29:35,001 INFO L226 Difference]: Without dead ends: 140 [2019-12-07 11:29:35,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:29:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-07 11:29:35,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 117. [2019-12-07 11:29:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-12-07 11:29:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2019-12-07 11:29:35,008 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 7 [2019-12-07 11:29:35,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:35,008 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2019-12-07 11:29:35,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2019-12-07 11:29:35,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:29:35,009 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:35,009 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:35,009 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:29:35,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:35,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1017489174, now seen corresponding path program 1 times [2019-12-07 11:29:35,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:29:35,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231709605] [2019-12-07 11:29:35,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:35,034 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 11:29:35,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231709605] [2019-12-07 11:29:35,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:35,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:29:35,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681382648] [2019-12-07 11:29:35,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:35,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:29:35,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:35,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:35,036 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand 4 states. [2019-12-07 11:29:35,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:35,124 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2019-12-07 11:29:35,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:35,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 11:29:35,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:35,126 INFO L225 Difference]: With dead ends: 129 [2019-12-07 11:29:35,126 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 11:29:35,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:29:35,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 11:29:35,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 115. [2019-12-07 11:29:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 11:29:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2019-12-07 11:29:35,132 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 9 [2019-12-07 11:29:35,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:35,132 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2019-12-07 11:29:35,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2019-12-07 11:29:35,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:29:35,132 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:35,132 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:35,133 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:29:35,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:35,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1017483307, now seen corresponding path program 1 times [2019-12-07 11:29:35,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:29:35,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445504651] [2019-12-07 11:29:35,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:35,163 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 11:29:35,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445504651] [2019-12-07 11:29:35,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:35,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:35,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554384454] [2019-12-07 11:29:35,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:29:35,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:29:35,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:29:35,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:29:35,165 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand 5 states. [2019-12-07 11:29:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:35,320 INFO L93 Difference]: Finished difference Result 163 states and 180 transitions. [2019-12-07 11:29:35,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:29:35,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 11:29:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:35,321 INFO L225 Difference]: With dead ends: 163 [2019-12-07 11:29:35,321 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 11:29:35,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:29:35,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 11:29:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 114. [2019-12-07 11:29:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 11:29:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2019-12-07 11:29:35,326 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 9 [2019-12-07 11:29:35,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:35,327 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2019-12-07 11:29:35,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:29:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2019-12-07 11:29:35,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:29:35,327 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:35,327 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:35,327 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:29:35,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:35,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1017483306, now seen corresponding path program 1 times [2019-12-07 11:29:35,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:29:35,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644218816] [2019-12-07 11:29:35,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:35,363 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 11:29:35,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644218816] [2019-12-07 11:29:35,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:35,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:35,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666396164] [2019-12-07 11:29:35,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:29:35,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:29:35,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:29:35,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:29:35,364 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 5 states. [2019-12-07 11:29:35,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:35,526 INFO L93 Difference]: Finished difference Result 185 states and 202 transitions. [2019-12-07 11:29:35,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:29:35,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 11:29:35,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:35,528 INFO L225 Difference]: With dead ends: 185 [2019-12-07 11:29:35,528 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 11:29:35,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:29:35,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 11:29:35,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 113. [2019-12-07 11:29:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 11:29:35,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2019-12-07 11:29:35,532 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 9 [2019-12-07 11:29:35,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:35,532 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2019-12-07 11:29:35,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:29:35,532 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2019-12-07 11:29:35,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:29:35,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:35,532 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:35,533 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:29:35,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:35,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1451280799, now seen corresponding path program 1 times [2019-12-07 11:29:35,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:29:35,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953333968] [2019-12-07 11:29:35,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:35,587 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 11:29:35,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953333968] [2019-12-07 11:29:35,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:35,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:29:35,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950218489] [2019-12-07 11:29:35,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:29:35,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:29:35,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:29:35,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:29:35,589 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand 8 states. [2019-12-07 11:29:35,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:35,841 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2019-12-07 11:29:35,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:29:35,841 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-07 11:29:35,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:35,842 INFO L225 Difference]: With dead ends: 113 [2019-12-07 11:29:35,842 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 11:29:35,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:29:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 11:29:35,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-12-07 11:29:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 11:29:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2019-12-07 11:29:35,845 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 11 [2019-12-07 11:29:35,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:35,845 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2019-12-07 11:29:35,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:29:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2019-12-07 11:29:35,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:29:35,846 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:35,846 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:35,846 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:29:35,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:35,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1451280800, now seen corresponding path program 1 times [2019-12-07 11:29:35,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:29:35,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875496260] [2019-12-07 11:29:35,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:35,915 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 11:29:35,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875496260] [2019-12-07 11:29:35,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:35,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:29:35,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301589944] [2019-12-07 11:29:35,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:29:35,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:29:35,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:29:35,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:29:35,917 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 9 states. [2019-12-07 11:29:36,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:36,271 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2019-12-07 11:29:36,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:29:36,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-12-07 11:29:36,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:36,271 INFO L225 Difference]: With dead ends: 114 [2019-12-07 11:29:36,272 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 11:29:36,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:29:36,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 11:29:36,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2019-12-07 11:29:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 11:29:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2019-12-07 11:29:36,274 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 11 [2019-12-07 11:29:36,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:36,275 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2019-12-07 11:29:36,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:29:36,275 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2019-12-07 11:29:36,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 11:29:36,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:36,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:36,276 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:29:36,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:36,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1863192630, now seen corresponding path program 1 times [2019-12-07 11:29:36,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:29:36,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569447068] [2019-12-07 11:29:36,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:36,320 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 11:29:36,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569447068] [2019-12-07 11:29:36,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:36,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:29:36,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418518915] [2019-12-07 11:29:36,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:29:36,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:29:36,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:29:36,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:29:36,321 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 6 states. [2019-12-07 11:29:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:36,449 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2019-12-07 11:29:36,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:29:36,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-12-07 11:29:36,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:36,450 INFO L225 Difference]: With dead ends: 161 [2019-12-07 11:29:36,450 INFO L226 Difference]: Without dead ends: 161 [2019-12-07 11:29:36,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:29:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-12-07 11:29:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 113. [2019-12-07 11:29:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 11:29:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2019-12-07 11:29:36,453 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 12 [2019-12-07 11:29:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:36,453 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2019-12-07 11:29:36,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:29:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2019-12-07 11:29:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:29:36,453 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:36,453 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:36,454 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:29:36,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:36,454 INFO L82 PathProgramCache]: Analyzing trace with hash 438205058, now seen corresponding path program 1 times [2019-12-07 11:29:36,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:29:36,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255378868] [2019-12-07 11:29:36,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:36,488 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 11:29:36,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255378868] [2019-12-07 11:29:36,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:36,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:36,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907711282] [2019-12-07 11:29:36,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:29:36,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:29:36,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:29:36,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:29:36,489 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand 5 states. [2019-12-07 11:29:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:36,630 INFO L93 Difference]: Finished difference Result 171 states and 190 transitions. [2019-12-07 11:29:36,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:29:36,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 11:29:36,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:36,631 INFO L225 Difference]: With dead ends: 171 [2019-12-07 11:29:36,631 INFO L226 Difference]: Without dead ends: 171 [2019-12-07 11:29:36,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:29:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-07 11:29:36,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-12-07 11:29:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 11:29:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2019-12-07 11:29:36,635 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 16 [2019-12-07 11:29:36,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:36,635 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2019-12-07 11:29:36,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:29:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2019-12-07 11:29:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:29:36,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:36,636 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:36,636 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:29:36,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:36,636 INFO L82 PathProgramCache]: Analyzing trace with hash 438205059, now seen corresponding path program 1 times [2019-12-07 11:29:36,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:29:36,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275576876] [2019-12-07 11:29:36,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:36,680 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 11:29:36,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275576876] [2019-12-07 11:29:36,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:36,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:36,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510219813] [2019-12-07 11:29:36,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:29:36,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:29:36,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:29:36,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:29:36,682 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand 5 states. [2019-12-07 11:29:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:36,876 INFO L93 Difference]: Finished difference Result 193 states and 213 transitions. [2019-12-07 11:29:36,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:29:36,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 11:29:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:36,877 INFO L225 Difference]: With dead ends: 193 [2019-12-07 11:29:36,877 INFO L226 Difference]: Without dead ends: 193 [2019-12-07 11:29:36,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:29:36,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-12-07 11:29:36,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 111. [2019-12-07 11:29:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 11:29:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2019-12-07 11:29:36,880 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 16 [2019-12-07 11:29:36,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:36,880 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2019-12-07 11:29:36,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:29:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2019-12-07 11:29:36,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 11:29:36,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:36,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:36,881 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:29:36,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:36,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1508648041, now seen corresponding path program 1 times [2019-12-07 11:29:36,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:29:36,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146844528] [2019-12-07 11:29:36,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:36,928 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 11:29:36,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146844528] [2019-12-07 11:29:36,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:36,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:29:36,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502005147] [2019-12-07 11:29:36,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:29:36,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:29:36,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:29:36,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:29:36,929 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 5 states. [2019-12-07 11:29:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:37,026 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2019-12-07 11:29:37,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:29:37,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 11:29:37,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:37,027 INFO L225 Difference]: With dead ends: 112 [2019-12-07 11:29:37,027 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 11:29:37,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:29:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 11:29:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-12-07 11:29:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 11:29:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-12-07 11:29:37,029 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 17 [2019-12-07 11:29:37,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:37,030 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-12-07 11:29:37,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:29:37,030 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-12-07 11:29:37,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:29:37,031 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:37,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:37,031 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 11:29:37,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:37,031 INFO L82 PathProgramCache]: Analyzing trace with hash -476335169, now seen corresponding path program 1 times [2019-12-07 11:29:37,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:29:37,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145333598] [2019-12-07 11:29:37,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:29:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:29:37,066 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:29:37,067 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:29:37,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:29:37 BoogieIcfgContainer [2019-12-07 11:29:37,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:29:37,084 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:29:37,084 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:29:37,084 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:29:37,085 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:29:34" (3/4) ... [2019-12-07 11:29:37,086 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:29:37,116 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b9946a15-bcbd-4deb-9705-6d57ceb9d134/bin/utaipan/witness.graphml [2019-12-07 11:29:37,116 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:29:37,117 INFO L168 Benchmark]: Toolchain (without parser) took 3800.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 939.8 MB in the beginning and 1.0 GB in the end (delta: -88.1 MB). Peak memory consumption was 69.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:29:37,118 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:29:37,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -148.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:29:37,118 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:29:37,118 INFO L168 Benchmark]: Boogie Preprocessor took 23.62 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 11:29:37,119 INFO L168 Benchmark]: RCFGBuilder took 429.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:29:37,119 INFO L168 Benchmark]: TraceAbstraction took 2946.04 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -3.8 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:29:37,119 INFO L168 Benchmark]: Witness Printer took 31.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:29:37,121 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -148.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.62 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 429.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2946.04 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -3.8 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. * Witness Printer took 31.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1040]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L994] SLL* list = malloc(sizeof(SLL)); [L995] list->next = ((void*)0) [L996] list->prev = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list [L1029] COND FALSE !(!(((void*)0) != end)) [L1030] EXPR end->colour [L1030] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE ((void*)0) != end [L1034] EXPR end->colour [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR end->next [L1040] COND TRUE !(end->next) [L1040] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 65 error locations. Result: UNSAFE, OverallTime: 2.8s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 924 SDtfs, 1368 SDslu, 1361 SDs, 0 SdLazy, 2476 SolverSat, 166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 383 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 5987 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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 incorrect! Received shutdown request...