./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/verifythis/duplets.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/duplets.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/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 c261d11d6e37ef6eda45455c8074b5a0eac3352b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 15:06:40,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:06:40,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:06:40,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:06:40,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:06:40,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:06:40,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:06:40,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:06:40,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:06:40,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:06:40,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:06:40,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:06:40,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:06:40,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:06:40,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:06:40,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:06:40,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:06:40,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:06:40,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:06:40,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:06:40,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:06:40,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:06:40,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:06:40,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:06:40,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:06:40,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:06:40,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:06:40,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:06:40,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:06:40,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:06:40,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:06:40,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:06:40,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:06:40,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:06:40,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:06:40,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:06:40,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:06:40,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:06:40,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:06:40,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:06:40,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:06:40,888 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 15:06:40,901 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:06:40,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:06:40,902 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 15:06:40,902 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 15:06:40,902 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 15:06:40,902 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 15:06:40,903 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 15:06:40,903 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 15:06:40,903 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 15:06:40,903 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 15:06:40,903 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 15:06:40,904 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 15:06:40,904 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 15:06:40,904 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 15:06:40,904 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 15:06:40,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:06:40,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:06:40,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:06:40,905 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:06:40,905 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 15:06:40,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:06:40,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:06:40,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:06:40,906 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 15:06:40,906 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 15:06:40,907 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 15:06:40,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:06:40,907 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:06:40,907 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:06:40,907 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:06:40,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:06:40,908 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:06:40,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:06:40,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:06:40,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:06:40,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:06:40,909 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 15:06:40,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:06:40,909 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:06:40,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 15:06:40,909 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_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/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 -> c261d11d6e37ef6eda45455c8074b5a0eac3352b [2019-12-07 15:06:41,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:06:41,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:06:41,020 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:06:41,021 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:06:41,021 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:06:41,021 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/bin/utaipan/../../sv-benchmarks/c/verifythis/duplets.c [2019-12-07 15:06:41,059 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/bin/utaipan/data/fe0a1754b/99994facc3dd42d2b8270915cb86d65d/FLAG0e091ecdb [2019-12-07 15:06:41,471 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:06:41,471 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/sv-benchmarks/c/verifythis/duplets.c [2019-12-07 15:06:41,475 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/bin/utaipan/data/fe0a1754b/99994facc3dd42d2b8270915cb86d65d/FLAG0e091ecdb [2019-12-07 15:06:41,484 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/bin/utaipan/data/fe0a1754b/99994facc3dd42d2b8270915cb86d65d [2019-12-07 15:06:41,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:06:41,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:06:41,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:06:41,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:06:41,489 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:06:41,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:06:41" (1/1) ... [2019-12-07 15:06:41,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45c8495d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:06:41, skipping insertion in model container [2019-12-07 15:06:41,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:06:41" (1/1) ... [2019-12-07 15:06:41,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:06:41,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:06:41,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:06:41,672 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:06:41,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:06:41,698 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:06:41,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:06:41 WrapperNode [2019-12-07 15:06:41,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:06:41,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:06:41,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:06:41,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:06:41,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:06:41" (1/1) ... [2019-12-07 15:06:41,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:06:41" (1/1) ... [2019-12-07 15:06:41,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:06:41,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:06:41,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:06:41,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:06:41,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:06:41" (1/1) ... [2019-12-07 15:06:41,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:06:41" (1/1) ... [2019-12-07 15:06:41,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:06:41" (1/1) ... [2019-12-07 15:06:41,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:06:41" (1/1) ... [2019-12-07 15:06:41,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:06:41" (1/1) ... [2019-12-07 15:06:41,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:06:41" (1/1) ... [2019-12-07 15:06:41,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:06:41" (1/1) ... [2019-12-07 15:06:41,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:06:41,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:06:41,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:06:41,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:06:41,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:06:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/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 15:06:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:06:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:06:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 15:06:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:06:41,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:06:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 15:06:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:06:42,158 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:06:42,159 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-12-07 15:06:42,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:06:42 BoogieIcfgContainer [2019-12-07 15:06:42,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:06:42,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:06:42,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:06:42,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:06:42,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:06:41" (1/3) ... [2019-12-07 15:06:42,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c8ea39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:06:42, skipping insertion in model container [2019-12-07 15:06:42,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:06:41" (2/3) ... [2019-12-07 15:06:42,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c8ea39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:06:42, skipping insertion in model container [2019-12-07 15:06:42,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:06:42" (3/3) ... [2019-12-07 15:06:42,164 INFO L109 eAbstractionObserver]: Analyzing ICFG duplets.c [2019-12-07 15:06:42,170 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:06:42,175 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2019-12-07 15:06:42,182 INFO L249 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2019-12-07 15:06:42,194 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:06:42,194 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 15:06:42,194 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:06:42,194 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:06:42,194 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:06:42,194 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:06:42,194 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:06:42,194 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:06:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2019-12-07 15:06:42,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 15:06:42,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:42,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 15:06:42,210 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:42,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:42,214 INFO L82 PathProgramCache]: Analyzing trace with hash 5927, now seen corresponding path program 1 times [2019-12-07 15:06:42,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:42,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780529187] [2019-12-07 15:06:42,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:42,331 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 15:06:42,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780529187] [2019-12-07 15:06:42,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:42,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:06:42,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180752998] [2019-12-07 15:06:42,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:06:42,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:42,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:06:42,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:06:42,351 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2019-12-07 15:06:42,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:42,415 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-12-07 15:06:42,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:06:42,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 15:06:42,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:42,423 INFO L225 Difference]: With dead ends: 64 [2019-12-07 15:06:42,423 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 15:06:42,424 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 15:06:42,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 15:06:42,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-12-07 15:06:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 15:06:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-12-07 15:06:42,448 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 2 [2019-12-07 15:06:42,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:42,449 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-12-07 15:06:42,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:06:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-12-07 15:06:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 15:06:42,449 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:42,449 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 15:06:42,449 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:42,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:42,450 INFO L82 PathProgramCache]: Analyzing trace with hash 5928, now seen corresponding path program 1 times [2019-12-07 15:06:42,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:42,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134734337] [2019-12-07 15:06:42,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:42,489 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 15:06:42,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134734337] [2019-12-07 15:06:42,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:42,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:06:42,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882481082] [2019-12-07 15:06:42,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:06:42,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:42,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:06:42,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:06:42,491 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 3 states. [2019-12-07 15:06:42,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:42,531 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-12-07 15:06:42,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:06:42,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 15:06:42,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:42,532 INFO L225 Difference]: With dead ends: 62 [2019-12-07 15:06:42,532 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 15:06:42,532 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 15:06:42,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 15:06:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 15:06:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 15:06:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-12-07 15:06:42,537 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 2 [2019-12-07 15:06:42,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:42,537 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-12-07 15:06:42,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:06:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-12-07 15:06:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 15:06:42,537 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:42,538 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 15:06:42,538 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:42,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:42,538 INFO L82 PathProgramCache]: Analyzing trace with hash 183716, now seen corresponding path program 1 times [2019-12-07 15:06:42,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:42,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821569651] [2019-12-07 15:06:42,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:42,570 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 15:06:42,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821569651] [2019-12-07 15:06:42,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:42,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:06:42,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034755044] [2019-12-07 15:06:42,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:06:42,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:42,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:06:42,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:06:42,572 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 3 states. [2019-12-07 15:06:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:42,607 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-12-07 15:06:42,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:06:42,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 15:06:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:42,609 INFO L225 Difference]: With dead ends: 61 [2019-12-07 15:06:42,609 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 15:06:42,609 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 15:06:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 15:06:42,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-12-07 15:06:42,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 15:06:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-12-07 15:06:42,613 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 3 [2019-12-07 15:06:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:42,613 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-12-07 15:06:42,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:06:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-12-07 15:06:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 15:06:42,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:42,614 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 15:06:42,614 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:42,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:42,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1182664410, now seen corresponding path program 1 times [2019-12-07 15:06:42,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:42,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975008697] [2019-12-07 15:06:42,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:42,665 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 15:06:42,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975008697] [2019-12-07 15:06:42,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:42,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:06:42,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117991985] [2019-12-07 15:06:42,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:06:42,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:42,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:06:42,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:06:42,667 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 4 states. [2019-12-07 15:06:42,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:42,719 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2019-12-07 15:06:42,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:06:42,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 15:06:42,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:42,720 INFO L225 Difference]: With dead ends: 55 [2019-12-07 15:06:42,720 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 15:06:42,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:06:42,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 15:06:42,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-12-07 15:06:42,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 15:06:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-12-07 15:06:42,725 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 6 [2019-12-07 15:06:42,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:42,725 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-12-07 15:06:42,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:06:42,725 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-12-07 15:06:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 15:06:42,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:42,726 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 15:06:42,726 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:42,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:42,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1182664411, now seen corresponding path program 1 times [2019-12-07 15:06:42,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:42,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717399697] [2019-12-07 15:06:42,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:42,800 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 15:06:42,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717399697] [2019-12-07 15:06:42,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:42,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:06:42,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537713766] [2019-12-07 15:06:42,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:06:42,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:42,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:06:42,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:06:42,801 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2019-12-07 15:06:43,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:43,030 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2019-12-07 15:06:43,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:06:43,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-12-07 15:06:43,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:43,032 INFO L225 Difference]: With dead ends: 131 [2019-12-07 15:06:43,032 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 15:06:43,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:06:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 15:06:43,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 53. [2019-12-07 15:06:43,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 15:06:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-12-07 15:06:43,038 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 6 [2019-12-07 15:06:43,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:43,038 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-12-07 15:06:43,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:06:43,039 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-12-07 15:06:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 15:06:43,039 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:43,039 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 15:06:43,039 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:43,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:43,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1182815199, now seen corresponding path program 1 times [2019-12-07 15:06:43,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:43,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183585433] [2019-12-07 15:06:43,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:43,067 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 15:06:43,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183585433] [2019-12-07 15:06:43,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:43,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:06:43,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971540545] [2019-12-07 15:06:43,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:06:43,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:43,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:06:43,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:06:43,069 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 3 states. [2019-12-07 15:06:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:43,075 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-12-07 15:06:43,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:06:43,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 15:06:43,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:43,077 INFO L225 Difference]: With dead ends: 54 [2019-12-07 15:06:43,077 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 15:06:43,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:06:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 15:06:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 15:06:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 15:06:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-12-07 15:06:43,081 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 6 [2019-12-07 15:06:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:43,081 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-12-07 15:06:43,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:06:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-12-07 15:06:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 15:06:43,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:43,082 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:06:43,083 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:43,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:43,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1992108951, now seen corresponding path program 1 times [2019-12-07 15:06:43,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:43,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807187322] [2019-12-07 15:06:43,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:43,152 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 15:06:43,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807187322] [2019-12-07 15:06:43,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:43,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:06:43,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672491289] [2019-12-07 15:06:43,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:06:43,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:43,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:06:43,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:06:43,154 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 7 states. [2019-12-07 15:06:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:43,275 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-12-07 15:06:43,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:06:43,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-12-07 15:06:43,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:43,276 INFO L225 Difference]: With dead ends: 52 [2019-12-07 15:06:43,276 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 15:06:43,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:06:43,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 15:06:43,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-07 15:06:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 15:06:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-12-07 15:06:43,279 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 7 [2019-12-07 15:06:43,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:43,279 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-12-07 15:06:43,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:06:43,279 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-12-07 15:06:43,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 15:06:43,280 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:43,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:06:43,280 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:43,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1138711369, now seen corresponding path program 1 times [2019-12-07 15:06:43,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:43,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851253444] [2019-12-07 15:06:43,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:43,301 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 15:06:43,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851253444] [2019-12-07 15:06:43,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:43,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:06:43,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274798070] [2019-12-07 15:06:43,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:06:43,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:43,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:06:43,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:06:43,303 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 3 states. [2019-12-07 15:06:43,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:43,332 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-12-07 15:06:43,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:06:43,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 15:06:43,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:43,333 INFO L225 Difference]: With dead ends: 51 [2019-12-07 15:06:43,333 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 15:06:43,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:06:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 15:06:43,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-12-07 15:06:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 15:06:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2019-12-07 15:06:43,336 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 9 [2019-12-07 15:06:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:43,336 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2019-12-07 15:06:43,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:06:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2019-12-07 15:06:43,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 15:06:43,336 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:43,336 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:06:43,337 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:43,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:43,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1138711370, now seen corresponding path program 1 times [2019-12-07 15:06:43,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:43,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424476339] [2019-12-07 15:06:43,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:43,369 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 15:06:43,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424476339] [2019-12-07 15:06:43,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:43,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:06:43,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617294869] [2019-12-07 15:06:43,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:06:43,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:43,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:06:43,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:06:43,371 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 4 states. [2019-12-07 15:06:43,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:43,407 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-12-07 15:06:43,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:06:43,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 15:06:43,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:43,408 INFO L225 Difference]: With dead ends: 50 [2019-12-07 15:06:43,408 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 15:06:43,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:06:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 15:06:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-07 15:06:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 15:06:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-12-07 15:06:43,410 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 9 [2019-12-07 15:06:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:43,411 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-12-07 15:06:43,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:06:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-12-07 15:06:43,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 15:06:43,411 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:43,411 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:06:43,411 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:43,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:43,412 INFO L82 PathProgramCache]: Analyzing trace with hash 940314082, now seen corresponding path program 1 times [2019-12-07 15:06:43,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:43,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135945518] [2019-12-07 15:06:43,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:43,438 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 15:06:43,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135945518] [2019-12-07 15:06:43,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:43,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:06:43,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270955827] [2019-12-07 15:06:43,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:06:43,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:43,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:06:43,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:06:43,439 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 3 states. [2019-12-07 15:06:43,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:43,468 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-12-07 15:06:43,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:06:43,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 15:06:43,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:43,469 INFO L225 Difference]: With dead ends: 49 [2019-12-07 15:06:43,469 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 15:06:43,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:06:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 15:06:43,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-12-07 15:06:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 15:06:43,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-12-07 15:06:43,473 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 10 [2019-12-07 15:06:43,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:43,473 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-12-07 15:06:43,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:06:43,473 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-12-07 15:06:43,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 15:06:43,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:43,474 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:06:43,474 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:43,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:43,474 INFO L82 PathProgramCache]: Analyzing trace with hash 940314083, now seen corresponding path program 1 times [2019-12-07 15:06:43,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:43,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602854423] [2019-12-07 15:06:43,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:06:43,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602854423] [2019-12-07 15:06:43,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:43,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:06:43,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219293797] [2019-12-07 15:06:43,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:06:43,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:43,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:06:43,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:06:43,512 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 4 states. [2019-12-07 15:06:43,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:43,550 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-12-07 15:06:43,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:06:43,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 15:06:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:43,550 INFO L225 Difference]: With dead ends: 48 [2019-12-07 15:06:43,550 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 15:06:43,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:06:43,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 15:06:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-07 15:06:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 15:06:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-12-07 15:06:43,552 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 10 [2019-12-07 15:06:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:43,553 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-12-07 15:06:43,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:06:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-12-07 15:06:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 15:06:43,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:43,553 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:06:43,553 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:43,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:43,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1698818694, now seen corresponding path program 1 times [2019-12-07 15:06:43,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:43,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106259678] [2019-12-07 15:06:43,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:43,573 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 15:06:43,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106259678] [2019-12-07 15:06:43,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:43,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:06:43,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274591086] [2019-12-07 15:06:43,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:06:43,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:43,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:06:43,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:06:43,575 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 4 states. [2019-12-07 15:06:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:43,611 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-12-07 15:06:43,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:06:43,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 15:06:43,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:43,611 INFO L225 Difference]: With dead ends: 44 [2019-12-07 15:06:43,611 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 15:06:43,612 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 15:06:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 15:06:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-07 15:06:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 15:06:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-12-07 15:06:43,613 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 12 [2019-12-07 15:06:43,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:43,614 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-12-07 15:06:43,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:06:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-12-07 15:06:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 15:06:43,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:43,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:06:43,615 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:43,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:43,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1698818695, now seen corresponding path program 1 times [2019-12-07 15:06:43,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:43,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533994197] [2019-12-07 15:06:43,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:43,660 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 15:06:43,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533994197] [2019-12-07 15:06:43,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:43,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:06:43,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674398524] [2019-12-07 15:06:43,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:06:43,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:43,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:06:43,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:06:43,662 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2019-12-07 15:06:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:43,699 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-12-07 15:06:43,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:06:43,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 15:06:43,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:43,699 INFO L225 Difference]: With dead ends: 40 [2019-12-07 15:06:43,699 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 15:06:43,700 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 15:06:43,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 15:06:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-07 15:06:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 15:06:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-12-07 15:06:43,701 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 12 [2019-12-07 15:06:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:43,701 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-12-07 15:06:43,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:06:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-12-07 15:06:43,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 15:06:43,702 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:43,702 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:06:43,702 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:43,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:43,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1910794940, now seen corresponding path program 1 times [2019-12-07 15:06:43,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:43,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594918222] [2019-12-07 15:06:43,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:43,722 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 15:06:43,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594918222] [2019-12-07 15:06:43,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:43,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:06:43,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087127318] [2019-12-07 15:06:43,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:06:43,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:43,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:06:43,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:06:43,723 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2019-12-07 15:06:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:43,757 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-12-07 15:06:43,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:06:43,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 15:06:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:43,757 INFO L225 Difference]: With dead ends: 36 [2019-12-07 15:06:43,758 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 15:06:43,758 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 15:06:43,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 15:06:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 15:06:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 15:06:43,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-12-07 15:06:43,760 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 15 [2019-12-07 15:06:43,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:43,760 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-12-07 15:06:43,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:06:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-12-07 15:06:43,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 15:06:43,760 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:43,761 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:06:43,761 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:43,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:43,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1910794941, now seen corresponding path program 1 times [2019-12-07 15:06:43,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:43,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43341962] [2019-12-07 15:06:43,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:43,797 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 15:06:43,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43341962] [2019-12-07 15:06:43,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:43,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:06:43,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483575610] [2019-12-07 15:06:43,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:06:43,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:43,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:06:43,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:06:43,798 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 4 states. [2019-12-07 15:06:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:43,833 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-12-07 15:06:43,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:06:43,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 15:06:43,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:43,834 INFO L225 Difference]: With dead ends: 32 [2019-12-07 15:06:43,834 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 15:06:43,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:06:43,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 15:06:43,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 15:06:43,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 15:06:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-12-07 15:06:43,836 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 15 [2019-12-07 15:06:43,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:43,836 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-12-07 15:06:43,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:06:43,836 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-12-07 15:06:43,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 15:06:43,837 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:43,837 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:06:43,837 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:43,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:43,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1691407098, now seen corresponding path program 1 times [2019-12-07 15:06:43,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:43,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848491260] [2019-12-07 15:06:43,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:06:43,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848491260] [2019-12-07 15:06:43,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:43,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 15:06:43,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263484238] [2019-12-07 15:06:43,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 15:06:43,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:43,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 15:06:43,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:06:43,905 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 8 states. [2019-12-07 15:06:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:44,044 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-12-07 15:06:44,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:06:44,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-07 15:06:44,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:44,045 INFO L225 Difference]: With dead ends: 35 [2019-12-07 15:06:44,045 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 15:06:44,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-07 15:06:44,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 15:06:44,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-12-07 15:06:44,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 15:06:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-12-07 15:06:44,047 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2019-12-07 15:06:44,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:44,047 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-12-07 15:06:44,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 15:06:44,047 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-12-07 15:06:44,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 15:06:44,047 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:44,048 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:06:44,048 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:44,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:44,048 INFO L82 PathProgramCache]: Analyzing trace with hash -585866250, now seen corresponding path program 1 times [2019-12-07 15:06:44,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:44,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734954263] [2019-12-07 15:06:44,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:44,107 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 15:06:44,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734954263] [2019-12-07 15:06:44,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:44,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 15:06:44,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121885186] [2019-12-07 15:06:44,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 15:06:44,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:44,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 15:06:44,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:06:44,108 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2019-12-07 15:06:44,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:44,206 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-12-07 15:06:44,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:06:44,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-07 15:06:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:44,207 INFO L225 Difference]: With dead ends: 32 [2019-12-07 15:06:44,207 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 15:06:44,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:06:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 15:06:44,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 15:06:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 15:06:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-12-07 15:06:44,209 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 22 [2019-12-07 15:06:44,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:44,210 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-12-07 15:06:44,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 15:06:44,210 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-12-07 15:06:44,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 15:06:44,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:44,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:06:44,211 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:44,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:44,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2140650377, now seen corresponding path program 1 times [2019-12-07 15:06:44,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:44,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593717760] [2019-12-07 15:06:44,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:44,444 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 15:06:44,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593717760] [2019-12-07 15:06:44,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:44,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 15:06:44,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103630494] [2019-12-07 15:06:44,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 15:06:44,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:44,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 15:06:44,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-12-07 15:06:44,446 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 13 states. [2019-12-07 15:06:44,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:44,938 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-12-07 15:06:44,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 15:06:44,938 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-12-07 15:06:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:44,939 INFO L225 Difference]: With dead ends: 61 [2019-12-07 15:06:44,939 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 15:06:44,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-12-07 15:06:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 15:06:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2019-12-07 15:06:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 15:06:44,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-12-07 15:06:44,942 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 23 [2019-12-07 15:06:44,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:44,942 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-12-07 15:06:44,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 15:06:44,942 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-12-07 15:06:44,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 15:06:44,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:44,943 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:06:44,943 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:44,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:44,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1121382182, now seen corresponding path program 1 times [2019-12-07 15:06:44,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:44,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349939651] [2019-12-07 15:06:44,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:06:44,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349939651] [2019-12-07 15:06:44,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236038882] [2019-12-07 15:06:44,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:06:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:45,018 INFO L264 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 15:06:45,022 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:06:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:06:45,041 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:06:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:06:45,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:06:45,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 5 [2019-12-07 15:06:45,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923574752] [2019-12-07 15:06:45,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:06:45,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:45,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:06:45,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:06:45,048 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 4 states. [2019-12-07 15:06:45,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:45,070 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2019-12-07 15:06:45,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:06:45,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 15:06:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:45,071 INFO L225 Difference]: With dead ends: 100 [2019-12-07 15:06:45,071 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 15:06:45,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 1 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 15:06:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 15:06:45,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 54. [2019-12-07 15:06:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 15:06:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-12-07 15:06:45,073 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 25 [2019-12-07 15:06:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:45,073 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-12-07 15:06:45,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:06:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-12-07 15:06:45,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 15:06:45,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:45,074 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:06:45,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:06:45,275 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:45,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:45,276 INFO L82 PathProgramCache]: Analyzing trace with hash -124320276, now seen corresponding path program 1 times [2019-12-07 15:06:45,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:45,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435916296] [2019-12-07 15:06:45,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:45,426 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 15:06:45,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435916296] [2019-12-07 15:06:45,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:06:45,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 15:06:45,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939951186] [2019-12-07 15:06:45,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 15:06:45,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:06:45,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 15:06:45,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:06:45,428 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 9 states. [2019-12-07 15:06:45,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:06:45,637 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-12-07 15:06:45,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 15:06:45,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-07 15:06:45,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:06:45,638 INFO L225 Difference]: With dead ends: 55 [2019-12-07 15:06:45,638 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 15:06:45,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-12-07 15:06:45,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 15:06:45,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-12-07 15:06:45,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 15:06:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-12-07 15:06:45,640 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 25 [2019-12-07 15:06:45,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:06:45,641 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-12-07 15:06:45,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 15:06:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-12-07 15:06:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 15:06:45,642 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:06:45,642 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:06:45,642 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:06:45,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:06:45,642 INFO L82 PathProgramCache]: Analyzing trace with hash 329972900, now seen corresponding path program 1 times [2019-12-07 15:06:45,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:06:45,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163636640] [2019-12-07 15:06:45,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:06:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:06:45,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163636640] [2019-12-07 15:06:45,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932577038] [2019-12-07 15:06:45,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:06:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:06:45,723 INFO L264 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 15:06:45,725 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:06:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:06:45,729 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:06:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:06:45,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1393071841] [2019-12-07 15:06:45,754 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 15:06:45,755 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 15:06:45,758 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 15:06:45,763 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 15:06:45,763 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 15:06:47,029 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 15:06:49,023 WARN L192 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 228 DAG size of output: 186 [2019-12-07 15:06:49,176 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-12-07 15:06:49,342 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-12-07 15:06:49,831 WARN L192 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 136 [2019-12-07 15:06:50,162 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2019-12-07 15:06:50,508 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 117 [2019-12-07 15:06:50,899 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 125 [2019-12-07 15:06:51,306 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 122 [2019-12-07 15:06:51,743 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 135 [2019-12-07 15:06:53,002 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 180 DAG size of output: 152 [2019-12-07 15:06:54,344 WARN L192 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 192 DAG size of output: 159 [2019-12-07 15:06:55,759 WARN L192 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 208 DAG size of output: 175 [2019-12-07 15:06:57,131 WARN L192 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 208 DAG size of output: 170 [2019-12-07 15:06:58,512 WARN L192 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 211 DAG size of output: 178 [2019-12-07 15:07:00,419 WARN L192 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 208 DAG size of output: 168 [2019-12-07 15:07:02,417 WARN L192 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2019-12-07 15:07:04,315 WARN L192 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 224 DAG size of output: 179 [2019-12-07 15:07:06,285 WARN L192 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 227 DAG size of output: 187 [2019-12-07 15:07:08,268 WARN L192 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 217 DAG size of output: 177 [2019-12-07 15:07:10,391 WARN L192 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 219 DAG size of output: 179 [2019-12-07 15:07:12,389 WARN L192 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 218 DAG size of output: 179 [2019-12-07 15:07:14,412 WARN L192 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 220 DAG size of output: 181 [2019-12-07 15:07:14,415 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 15:07:14,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 15:07:14,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-12-07 15:07:14,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544407551] [2019-12-07 15:07:14,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:07:14,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:07:14,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:07:14,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2019-12-07 15:07:14,416 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 6 states. [2019-12-07 15:07:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:07:14,459 INFO L93 Difference]: Finished difference Result 145 states and 151 transitions. [2019-12-07 15:07:14,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:07:14,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 15:07:14,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:07:14,460 INFO L225 Difference]: With dead ends: 145 [2019-12-07 15:07:14,460 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 15:07:14,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2019-12-07 15:07:14,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 15:07:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 61. [2019-12-07 15:07:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 15:07:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2019-12-07 15:07:14,462 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 29 [2019-12-07 15:07:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:07:14,463 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2019-12-07 15:07:14,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:07:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2019-12-07 15:07:14,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 15:07:14,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:07:14,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:07:14,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:07:14,664 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:07:14,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:07:14,665 INFO L82 PathProgramCache]: Analyzing trace with hash 715056017, now seen corresponding path program 1 times [2019-12-07 15:07:14,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:07:14,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651232377] [2019-12-07 15:07:14,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:07:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:07:14,875 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 15:07:14,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651232377] [2019-12-07 15:07:14,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:07:14,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:07:14,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154642078] [2019-12-07 15:07:14,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:07:14,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:07:14,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:07:14,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:07:14,876 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states. [2019-12-07 15:07:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:07:14,923 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2019-12-07 15:07:14,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:07:14,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 15:07:14,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:07:14,924 INFO L225 Difference]: With dead ends: 60 [2019-12-07 15:07:14,924 INFO L226 Difference]: Without dead ends: 39 [2019-12-07 15:07:14,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:07:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-07 15:07:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-12-07 15:07:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 15:07:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-12-07 15:07:14,926 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 29 [2019-12-07 15:07:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:07:14,926 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-12-07 15:07:14,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:07:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-12-07 15:07:14,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 15:07:14,927 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:07:14,927 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:07:14,927 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:07:14,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:07:14,927 INFO L82 PathProgramCache]: Analyzing trace with hash 413145890, now seen corresponding path program 2 times [2019-12-07 15:07:14,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:07:14,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007701625] [2019-12-07 15:07:14,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:07:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:07:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:07:15,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007701625] [2019-12-07 15:07:15,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299856552] [2019-12-07 15:07:15,217 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:07:15,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-12-07 15:07:15,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:07:15,255 INFO L264 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-07 15:07:15,258 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:07:15,615 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 15:07:15,615 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:07:15,898 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-12-07 15:07:16,064 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-12-07 15:07:16,110 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-12-07 15:07:16,246 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-12-07 15:07:16,508 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 15:07:16,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [287138345] [2019-12-07 15:07:16,509 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 15:07:16,510 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 15:07:16,510 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 15:07:16,510 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 15:07:16,510 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 15:07:17,497 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 15:07:19,581 WARN L192 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 228 DAG size of output: 186 [2019-12-07 15:07:19,826 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-12-07 15:07:20,171 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-12-07 15:07:20,772 WARN L192 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 136 [2019-12-07 15:07:21,186 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2019-12-07 15:07:21,644 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 117 [2019-12-07 15:07:22,162 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 125 [2019-12-07 15:07:22,568 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 122 [2019-12-07 15:07:23,070 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 135 [2019-12-07 15:07:24,416 WARN L192 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 180 DAG size of output: 152 [2019-12-07 15:07:25,803 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 192 DAG size of output: 159 [2019-12-07 15:07:27,324 WARN L192 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 208 DAG size of output: 175 [2019-12-07 15:07:28,816 WARN L192 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 208 DAG size of output: 170 [2019-12-07 15:07:30,345 WARN L192 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 211 DAG size of output: 178 [2019-12-07 15:07:32,418 WARN L192 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 208 DAG size of output: 168 [2019-12-07 15:07:34,529 WARN L192 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2019-12-07 15:07:36,617 WARN L192 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 224 DAG size of output: 179 [2019-12-07 15:07:38,734 WARN L192 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 227 DAG size of output: 187 [2019-12-07 15:07:40,967 WARN L192 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 217 DAG size of output: 177 [2019-12-07 15:07:43,075 WARN L192 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 219 DAG size of output: 179 [2019-12-07 15:07:45,191 WARN L192 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 218 DAG size of output: 179 [2019-12-07 15:07:47,350 WARN L192 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 220 DAG size of output: 181 [2019-12-07 15:07:47,351 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 15:07:47,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 15:07:47,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 28 [2019-12-07 15:07:47,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045762230] [2019-12-07 15:07:47,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 15:07:47,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:07:47,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 15:07:47,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2384, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 15:07:47,353 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 30 states. [2019-12-07 15:07:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:07:49,513 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-12-07 15:07:49,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 15:07:49,513 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 33 [2019-12-07 15:07:49,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:07:49,513 INFO L225 Difference]: With dead ends: 57 [2019-12-07 15:07:49,513 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 15:07:49,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=739, Invalid=4091, Unknown=0, NotChecked=0, Total=4830 [2019-12-07 15:07:49,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 15:07:49,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 15:07:49,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 15:07:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 15:07:49,515 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-12-07 15:07:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:07:49,515 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 15:07:49,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 15:07:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 15:07:49,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 15:07:49,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:07:49,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:07:49 BoogieIcfgContainer [2019-12-07 15:07:49,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:07:49,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:07:49,724 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:07:49,724 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:07:49,724 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:06:42" (3/4) ... [2019-12-07 15:07:49,727 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 15:07:49,736 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2019-12-07 15:07:49,736 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-12-07 15:07:49,736 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 15:07:49,769 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1d350d2a-f0d9-42a0-b36f-dd16da94cc87/bin/utaipan/witness.graphml [2019-12-07 15:07:49,769 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:07:49,770 INFO L168 Benchmark]: Toolchain (without parser) took 68283.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 254.8 MB). Free memory was 948.9 MB in the beginning and 1.2 GB in the end (delta: -278.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:07:49,770 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:07:49,770 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 948.9 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 15:07:49,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:07:49,770 INFO L168 Benchmark]: Boogie Preprocessor took 20.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:07:49,770 INFO L168 Benchmark]: RCFGBuilder took 409.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. [2019-12-07 15:07:49,771 INFO L168 Benchmark]: TraceAbstraction took 67562.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 126.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -170.8 MB). Peak memory consumption was 382.1 MB. Max. memory is 11.5 GB. [2019-12-07 15:07:49,771 INFO L168 Benchmark]: Witness Printer took 45.45 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:07:49,772 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 211.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 948.9 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 409.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 67562.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 126.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -170.8 MB). Peak memory consumption was 382.1 MB. Max. memory is 11.5 GB. * Witness Printer took 45.45 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 36 error locations. Result: SAFE, OverallTime: 67.5s, OverallIterations: 23, TraceHistogramMax: 3, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 567 SDtfs, 2136 SDslu, 425 SDs, 0 SdLazy, 1487 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 386 GetRequests, 181 SyntacticMatches, 5 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1342 ImplicationChecksByTransitivity, 61.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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, 23 MinimizatonAttempts, 219 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 418 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 476 ConstructedInterpolants, 23 QuantifiedInterpolants, 185411 SizeOfPredicates, 39 NumberOfNonLiveVariables, 658 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 29 InterpolantComputations, 22 PerfectInterpolantSequences, 41/75 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...