./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/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 eb5e103dbe59a250cbe01613b667895523582d5d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/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 eb5e103dbe59a250cbe01613b667895523582d5d ....................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort FloatRoundingMode not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:21:49,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:49,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:49,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:49,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:49,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:49,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:49,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:49,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:49,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:49,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:49,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:49,837 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:49,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:49,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:49,841 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:49,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:49,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:49,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:49,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:49,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:49,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:49,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:49,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:49,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:49,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:49,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:49,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:49,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:49,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:49,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:49,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:49,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:49,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:49,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:49,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:49,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:49,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:49,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:49,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:49,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:49,861 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:21:49,871 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:49,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:49,872 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:49,872 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:49,872 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:49,872 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:49,872 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:49,872 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:49,873 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:49,873 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:49,873 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:49,873 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:49,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:21:49,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:21:49,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:49,874 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:49,875 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:21:49,875 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:49,875 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:49,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:49,875 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:21:49,875 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:21:49,876 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:21:49,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:49,876 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:49,876 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:49,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:49,876 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:49,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:49,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:49,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:49,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:49,877 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:49,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:49,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:49,878 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/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/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 -> eb5e103dbe59a250cbe01613b667895523582d5d [2019-10-22 11:21:49,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:49,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:49,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:49,927 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:49,928 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:49,928 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/../../sv-benchmarks/c/list-ext-properties/test-0019_1-1.i [2019-10-22 11:21:49,973 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/data/46827293f/f36c3c52f9c2436f87e842f2e468b582/FLAGe37bd7c82 [2019-10-22 11:21:50,378 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:50,379 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/sv-benchmarks/c/list-ext-properties/test-0019_1-1.i [2019-10-22 11:21:50,393 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/data/46827293f/f36c3c52f9c2436f87e842f2e468b582/FLAGe37bd7c82 [2019-10-22 11:21:50,402 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/data/46827293f/f36c3c52f9c2436f87e842f2e468b582 [2019-10-22 11:21:50,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:50,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:50,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:50,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:50,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:50,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:50" (1/1) ... [2019-10-22 11:21:50,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@489ebe77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:50, skipping insertion in model container [2019-10-22 11:21:50,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:50" (1/1) ... [2019-10-22 11:21:50,420 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:50,450 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:50,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:50,793 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:50,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:50,878 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:50,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:50 WrapperNode [2019-10-22 11:21:50,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:50,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:50,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:50,880 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:50,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:50" (1/1) ... [2019-10-22 11:21:50,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:50" (1/1) ... [2019-10-22 11:21:50,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:50,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:50,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:50,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:50,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:50" (1/1) ... [2019-10-22 11:21:50,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:50" (1/1) ... [2019-10-22 11:21:50,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:50" (1/1) ... [2019-10-22 11:21:50,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:50" (1/1) ... [2019-10-22 11:21:50,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:50" (1/1) ... [2019-10-22 11:21:50,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:50" (1/1) ... [2019-10-22 11:21:50,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:50" (1/1) ... [2019-10-22 11:21:50,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:50,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:50,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:50,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:50,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/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-10-22 11:21:51,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:21:51,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:21:51,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:21:51,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:21:51,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:21:51,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:21:51,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:21:51,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:51,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:51,447 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:51,447 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 11:21:51,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:51 BoogieIcfgContainer [2019-10-22 11:21:51,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:51,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:51,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:51,455 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:51,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:50" (1/3) ... [2019-10-22 11:21:51,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d214d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:51, skipping insertion in model container [2019-10-22 11:21:51,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:50" (2/3) ... [2019-10-22 11:21:51,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d214d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:51, skipping insertion in model container [2019-10-22 11:21:51,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:51" (3/3) ... [2019-10-22 11:21:51,458 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019_1-1.i [2019-10-22 11:21:51,467 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:51,475 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-10-22 11:21:51,484 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-10-22 11:21:51,496 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:51,497 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:21:51,497 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:51,497 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:51,497 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:51,497 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:51,497 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:51,497 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-10-22 11:21:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:21:51,515 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:51,516 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:21:51,518 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:51,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:51,523 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-10-22 11:21:51,529 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:51,529 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820043752] [2019-10-22 11:21:51,529 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:51,530 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:51,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:51,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820043752] [2019-10-22 11:21:51,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:51,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:51,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92601480] [2019-10-22 11:21:51,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:51,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:51,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:51,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:51,691 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2019-10-22 11:21:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:51,801 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-10-22 11:21:51,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:51,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:21:51,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:51,813 INFO L225 Difference]: With dead ends: 65 [2019-10-22 11:21:51,814 INFO L226 Difference]: Without dead ends: 63 [2019-10-22 11:21:51,816 INFO L600 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-10-22 11:21:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-22 11:21:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2019-10-22 11:21:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-22 11:21:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-10-22 11:21:51,844 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 3 [2019-10-22 11:21:51,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:51,844 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-10-22 11:21:51,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-10-22 11:21:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:21:51,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:51,845 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:21:51,845 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:51,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:51,846 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-10-22 11:21:51,846 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:51,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229386285] [2019-10-22 11:21:51,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:51,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:51,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:51,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:51,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229386285] [2019-10-22 11:21:51,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:51,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:51,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034644403] [2019-10-22 11:21:51,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:51,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:51,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:51,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:51,894 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 3 states. [2019-10-22 11:21:51,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:51,973 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-10-22 11:21:51,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:51,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:21:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:51,974 INFO L225 Difference]: With dead ends: 55 [2019-10-22 11:21:51,974 INFO L226 Difference]: Without dead ends: 55 [2019-10-22 11:21:51,975 INFO L600 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-10-22 11:21:51,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-22 11:21:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-22 11:21:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-22 11:21:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-10-22 11:21:51,982 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 3 [2019-10-22 11:21:51,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:51,983 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-10-22 11:21:51,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-10-22 11:21:51,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-10-22 11:21:51,983 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:51,983 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-10-22 11:21:51,984 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:51,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:51,984 INFO L82 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2019-10-22 11:21:51,985 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:51,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191800459] [2019-10-22 11:21:51,987 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:51,987 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:51,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:52,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191800459] [2019-10-22 11:21:52,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:52,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:52,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803333479] [2019-10-22 11:21:52,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:52,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:52,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:52,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:52,087 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 5 states. [2019-10-22 11:21:52,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:52,169 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-10-22 11:21:52,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:52,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-10-22 11:21:52,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:52,170 INFO L225 Difference]: With dead ends: 59 [2019-10-22 11:21:52,170 INFO L226 Difference]: Without dead ends: 59 [2019-10-22 11:21:52,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:52,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-22 11:21:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2019-10-22 11:21:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-22 11:21:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-10-22 11:21:52,175 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 5 [2019-10-22 11:21:52,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:52,175 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-10-22 11:21:52,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-10-22 11:21:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:21:52,176 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:52,176 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:52,176 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:52,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:52,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1803024997, now seen corresponding path program 1 times [2019-10-22 11:21:52,177 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:52,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838813371] [2019-10-22 11:21:52,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:52,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:52,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:52,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838813371] [2019-10-22 11:21:52,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:52,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:52,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57102792] [2019-10-22 11:21:52,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:52,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:52,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:52,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:52,257 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 5 states. [2019-10-22 11:21:52,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:52,409 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-10-22 11:21:52,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:52,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-10-22 11:21:52,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:52,411 INFO L225 Difference]: With dead ends: 58 [2019-10-22 11:21:52,411 INFO L226 Difference]: Without dead ends: 58 [2019-10-22 11:21:52,411 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:52,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-22 11:21:52,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2019-10-22 11:21:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-22 11:21:52,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-10-22 11:21:52,414 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 7 [2019-10-22 11:21:52,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:52,415 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-10-22 11:21:52,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-10-22 11:21:52,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:21:52,415 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:52,415 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:52,416 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:52,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:52,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1803024998, now seen corresponding path program 1 times [2019-10-22 11:21:52,416 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:52,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617482460] [2019-10-22 11:21:52,417 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:52,417 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:52,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:52,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617482460] [2019-10-22 11:21:52,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:52,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:52,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962403263] [2019-10-22 11:21:52,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:52,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:52,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:52,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:52,493 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 5 states. [2019-10-22 11:21:52,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:52,589 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-10-22 11:21:52,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:52,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-10-22 11:21:52,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:52,589 INFO L225 Difference]: With dead ends: 50 [2019-10-22 11:21:52,590 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 11:21:52,590 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 11:21:52,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-22 11:21:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-22 11:21:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-10-22 11:21:52,594 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 7 [2019-10-22 11:21:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:52,595 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-10-22 11:21:52,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-10-22 11:21:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:21:52,595 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:52,595 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:52,596 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:52,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1056667984, now seen corresponding path program 1 times [2019-10-22 11:21:52,596 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:52,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802182762] [2019-10-22 11:21:52,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:52,597 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:52,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:52,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802182762] [2019-10-22 11:21:52,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:52,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:21:52,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083448174] [2019-10-22 11:21:52,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:21:52,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:52,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:21:52,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:52,695 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 9 states. [2019-10-22 11:21:52,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:52,881 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-10-22 11:21:52,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:21:52,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-10-22 11:21:52,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:52,882 INFO L225 Difference]: With dead ends: 49 [2019-10-22 11:21:52,882 INFO L226 Difference]: Without dead ends: 49 [2019-10-22 11:21:52,883 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:21:52,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-22 11:21:52,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-10-22 11:21:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-22 11:21:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-10-22 11:21:52,886 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 10 [2019-10-22 11:21:52,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:52,886 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-10-22 11:21:52,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:21:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-10-22 11:21:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:21:52,887 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:52,887 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:52,887 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:52,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:52,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1056667985, now seen corresponding path program 1 times [2019-10-22 11:21:52,888 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:52,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383743740] [2019-10-22 11:21:52,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:52,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:52,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:53,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383743740] [2019-10-22 11:21:53,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:53,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:21:53,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606196678] [2019-10-22 11:21:53,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:21:53,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:53,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:21:53,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:53,033 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 9 states. [2019-10-22 11:21:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:53,281 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-10-22 11:21:53,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:21:53,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-10-22 11:21:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:53,282 INFO L225 Difference]: With dead ends: 48 [2019-10-22 11:21:53,282 INFO L226 Difference]: Without dead ends: 48 [2019-10-22 11:21:53,283 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:21:53,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-22 11:21:53,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-10-22 11:21:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-22 11:21:53,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-10-22 11:21:53,286 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 10 [2019-10-22 11:21:53,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:53,286 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-10-22 11:21:53,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:21:53,286 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-10-22 11:21:53,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:21:53,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:53,287 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:53,287 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:53,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:53,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1380592074, now seen corresponding path program 1 times [2019-10-22 11:21:53,288 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:53,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620248848] [2019-10-22 11:21:53,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:53,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:53,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:53,384 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620248848] [2019-10-22 11:21:53,384 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:53,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:53,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12379926] [2019-10-22 11:21:53,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:53,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:53,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:53,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:53,386 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 5 states. [2019-10-22 11:21:53,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:53,455 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-10-22 11:21:53,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:53,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-22 11:21:53,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:53,456 INFO L225 Difference]: With dead ends: 50 [2019-10-22 11:21:53,456 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 11:21:53,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:53,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 11:21:53,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2019-10-22 11:21:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-22 11:21:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-10-22 11:21:53,459 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 13 [2019-10-22 11:21:53,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:53,459 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-10-22 11:21:53,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:53,459 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-10-22 11:21:53,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:21:53,460 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:53,460 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:53,460 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:53,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:53,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1380592075, now seen corresponding path program 1 times [2019-10-22 11:21:53,461 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:53,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271824431] [2019-10-22 11:21:53,461 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:53,461 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:53,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:53,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:53,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271824431] [2019-10-22 11:21:53,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:53,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:21:53,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908932472] [2019-10-22 11:21:53,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:21:53,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:53,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:21:53,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:53,572 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 7 states. [2019-10-22 11:21:53,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:53,652 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-10-22 11:21:53,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:53,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-10-22 11:21:53,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:53,653 INFO L225 Difference]: With dead ends: 42 [2019-10-22 11:21:53,653 INFO L226 Difference]: Without dead ends: 42 [2019-10-22 11:21:53,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:53,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-22 11:21:53,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-22 11:21:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 11:21:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-10-22 11:21:53,656 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 13 [2019-10-22 11:21:53,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:53,656 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-10-22 11:21:53,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:21:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-10-22 11:21:53,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:21:53,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:53,657 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:53,657 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:53,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:53,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1781252300, now seen corresponding path program 1 times [2019-10-22 11:21:53,658 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:53,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388084876] [2019-10-22 11:21:53,658 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:53,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:53,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:54,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388084876] [2019-10-22 11:21:54,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:54,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-22 11:21:54,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703114595] [2019-10-22 11:21:54,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-22 11:21:54,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:54,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 11:21:54,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:21:54,022 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 13 states. [2019-10-22 11:21:54,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:54,609 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-10-22 11:21:54,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:21:54,610 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-10-22 11:21:54,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:54,610 INFO L225 Difference]: With dead ends: 42 [2019-10-22 11:21:54,610 INFO L226 Difference]: Without dead ends: 42 [2019-10-22 11:21:54,611 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-10-22 11:21:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-22 11:21:54,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-10-22 11:21:54,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 11:21:54,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-10-22 11:21:54,613 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 17 [2019-10-22 11:21:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:54,613 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-10-22 11:21:54,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-22 11:21:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-10-22 11:21:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:21:54,613 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:54,613 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:54,614 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:54,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:54,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1781252301, now seen corresponding path program 1 times [2019-10-22 11:21:54,614 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:54,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624014371] [2019-10-22 11:21:54,621 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,621 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:54,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624014371] [2019-10-22 11:21:54,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:54,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-22 11:21:54,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521554026] [2019-10-22 11:21:54,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-22 11:21:54,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:54,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 11:21:54,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:21:54,980 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 13 states. [2019-10-22 11:21:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:55,598 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-10-22 11:21:55,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 11:21:55,603 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-10-22 11:21:55,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:55,603 INFO L225 Difference]: With dead ends: 38 [2019-10-22 11:21:55,603 INFO L226 Difference]: Without dead ends: 38 [2019-10-22 11:21:55,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-10-22 11:21:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-22 11:21:55,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-22 11:21:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-22 11:21:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-10-22 11:21:55,605 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 17 [2019-10-22 11:21:55,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:55,606 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-10-22 11:21:55,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-22 11:21:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-10-22 11:21:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:21:55,606 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:55,606 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:55,607 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:55,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:55,607 INFO L82 PathProgramCache]: Analyzing trace with hash -615753541, now seen corresponding path program 1 times [2019-10-22 11:21:55,607 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:55,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985794617] [2019-10-22 11:21:55,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:55,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:55,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985794617] [2019-10-22 11:21:55,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:55,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-22 11:21:55,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565060003] [2019-10-22 11:21:55,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-22 11:21:55,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:55,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 11:21:55,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:21:55,961 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 13 states. [2019-10-22 11:21:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:56,417 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-10-22 11:21:56,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 11:21:56,417 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2019-10-22 11:21:56,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:56,417 INFO L225 Difference]: With dead ends: 39 [2019-10-22 11:21:56,417 INFO L226 Difference]: Without dead ends: 39 [2019-10-22 11:21:56,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2019-10-22 11:21:56,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-22 11:21:56,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-22 11:21:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 11:21:56,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-10-22 11:21:56,420 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 18 [2019-10-22 11:21:56,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:56,420 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-10-22 11:21:56,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-22 11:21:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-10-22 11:21:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:21:56,421 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:56,421 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:56,421 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:56,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:56,421 INFO L82 PathProgramCache]: Analyzing trace with hash -615753540, now seen corresponding path program 1 times [2019-10-22 11:21:56,421 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:56,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104911173] [2019-10-22 11:21:56,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:56,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:56,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104911173] [2019-10-22 11:21:56,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:56,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-22 11:21:56,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233699228] [2019-10-22 11:21:56,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-22 11:21:56,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:56,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 11:21:56,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:21:56,775 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 13 states. [2019-10-22 11:21:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:57,288 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-10-22 11:21:57,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:21:57,288 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2019-10-22 11:21:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:57,289 INFO L225 Difference]: With dead ends: 35 [2019-10-22 11:21:57,289 INFO L226 Difference]: Without dead ends: 35 [2019-10-22 11:21:57,289 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-10-22 11:21:57,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-22 11:21:57,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-10-22 11:21:57,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-22 11:21:57,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-10-22 11:21:57,291 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 18 [2019-10-22 11:21:57,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:57,292 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-10-22 11:21:57,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-22 11:21:57,292 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-10-22 11:21:57,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:21:57,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:57,292 INFO L380 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-10-22 11:21:57,293 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:57,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:57,293 INFO L82 PathProgramCache]: Analyzing trace with hash -108406735, now seen corresponding path program 1 times [2019-10-22 11:21:57,293 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:57,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674858992] [2019-10-22 11:21:57,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:57,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674858992] [2019-10-22 11:21:57,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:57,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-22 11:21:57,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132826135] [2019-10-22 11:21:57,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-22 11:21:57,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:57,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 11:21:57,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:21:57,581 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 13 states. [2019-10-22 11:21:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:57,953 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-10-22 11:21:57,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 11:21:57,953 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-10-22 11:21:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:57,954 INFO L225 Difference]: With dead ends: 34 [2019-10-22 11:21:57,954 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:21:57,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-10-22 11:21:57,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:21:57,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-22 11:21:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:21:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-10-22 11:21:57,956 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 21 [2019-10-22 11:21:57,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:57,956 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-10-22 11:21:57,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-22 11:21:57,956 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-10-22 11:21:57,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:21:57,957 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:57,957 INFO L380 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-10-22 11:21:57,957 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:21:57,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:57,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1086293405, now seen corresponding path program 1 times [2019-10-22 11:21:57,958 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:57,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728451720] [2019-10-22 11:21:57,958 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,958 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:58,019 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:21:58,019 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:21:58,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:58 BoogieIcfgContainer [2019-10-22 11:21:58,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:58,048 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:58,048 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:58,048 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:58,048 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:51" (3/4) ... [2019-10-22 11:21:58,052 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 11:21:58,052 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:58,054 INFO L168 Benchmark]: Toolchain (without parser) took 7647.08 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 361.8 MB). Free memory was 935.6 MB in the beginning and 1.3 GB in the end (delta: -348.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:58,054 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:58,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 472.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 935.6 MB in the beginning and 1.2 GB in the end (delta: -251.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:58,055 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:58,055 INFO L168 Benchmark]: Boogie Preprocessor took 26.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:58,056 INFO L168 Benchmark]: RCFGBuilder took 502.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:58,056 INFO L168 Benchmark]: TraceAbstraction took 6598.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 152.0 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -132.5 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:58,056 INFO L168 Benchmark]: Witness Printer took 4.36 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:58,059 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 472.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 935.6 MB in the beginning and 1.2 GB in the end (delta: -251.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 502.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6598.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 152.0 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -132.5 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.36 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 534]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 534. Possible FailurePath: [L535] TData data; [L518] pdata->lo = (int *)malloc(sizeof(int)) [L519] pdata->hi = (int *)malloc(sizeof(int)) [L520] EXPR pdata->lo [L520] *(pdata->lo) = 4 [L521] EXPR pdata->hi [L521] *(pdata->hi) = 8 [L525] EXPR data->lo [L525] int *lo = data->lo; [L526] EXPR data->hi [L526] int *hi = data->hi; [L527] EXPR \read(*lo) [L527] EXPR \read(*hi) [L527] COND FALSE !(*lo >= *hi) [L531] data->lo = ((void *)0) [L532] data->hi = ((void *)0) [L538] return 0; [L538] return 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 62 locations, 31 error locations. Result: UNSAFE, OverallTime: 6.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 352 SDtfs, 1195 SDslu, 609 SDs, 0 SdLazy, 1223 SolverSat, 195 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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, 14 MinimizatonAttempts, 29 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 31604 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:22:00,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:00,077 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:00,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:00,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:00,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:00,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:00,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:00,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:00,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:00,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:00,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:00,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:00,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:00,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:00,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:00,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:00,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:00,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:00,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:00,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:00,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:00,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:00,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:00,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:00,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:00,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:00,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:00,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:00,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:00,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:00,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:00,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:00,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:00,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:00,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:00,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:00,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:00,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:00,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:00,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:00,115 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-10-22 11:22:00,126 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:00,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:00,127 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:00,127 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:00,127 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:00,128 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:00,128 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:00,128 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:00,128 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:00,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:22:00,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:22:00,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:00,129 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:00,129 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:22:00,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:22:00,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:00,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:00,130 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:22:00,130 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:22:00,130 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:22:00,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:00,133 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:22:00,133 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:22:00,133 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:00,133 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:22:00,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:00,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:00,134 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:00,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:00,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:00,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:00,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:00,135 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:22:00,135 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:22:00,136 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:00,136 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/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 -> eb5e103dbe59a250cbe01613b667895523582d5d [2019-10-22 11:22:00,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:00,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:00,184 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:00,185 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:00,185 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:00,186 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/../../sv-benchmarks/c/list-ext-properties/test-0019_1-1.i [2019-10-22 11:22:00,231 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/data/e4c2bcd97/f4c7313216da4949a8579aea5e8d047c/FLAG36792add2 [2019-10-22 11:22:00,664 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:00,665 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/sv-benchmarks/c/list-ext-properties/test-0019_1-1.i [2019-10-22 11:22:00,676 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/data/e4c2bcd97/f4c7313216da4949a8579aea5e8d047c/FLAG36792add2 [2019-10-22 11:22:01,006 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/data/e4c2bcd97/f4c7313216da4949a8579aea5e8d047c [2019-10-22 11:22:01,009 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:01,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:01,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:01,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:01,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:01,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@348433d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01, skipping insertion in model container [2019-10-22 11:22:01,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,024 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:01,061 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:01,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:01,368 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:01,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:01,526 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:01,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01 WrapperNode [2019-10-22 11:22:01,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:01,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:01,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:01,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:01,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:01,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:01,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:01,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:01,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... [2019-10-22 11:22:01,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:01,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:01,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:01,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:01,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/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-10-22 11:22:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:22:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:22:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:22:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:22:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:22:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:22:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:22:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:01,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:02,096 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:02,096 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 11:22:02,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:02 BoogieIcfgContainer [2019-10-22 11:22:02,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:02,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:02,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:02,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:02,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:01" (1/3) ... [2019-10-22 11:22:02,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac478bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:02, skipping insertion in model container [2019-10-22 11:22:02,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:01" (2/3) ... [2019-10-22 11:22:02,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac478bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:02, skipping insertion in model container [2019-10-22 11:22:02,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:02" (3/3) ... [2019-10-22 11:22:02,104 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019_1-1.i [2019-10-22 11:22:02,112 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:02,119 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-10-22 11:22:02,129 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-10-22 11:22:02,143 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:02,143 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:22:02,143 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:02,143 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:02,143 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:02,143 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:02,143 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:02,143 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:02,156 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-10-22 11:22:02,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:22:02,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:02,163 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:22:02,165 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2019-10-22 11:22:02,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:02,170 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-10-22 11:22:02,177 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:02,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1693187861] [2019-10-22 11:22:02,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ff625e31-057d-46f3-bed1-ccc68890930b/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:02,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:02,410 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort FloatRoundingMode not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 11:22:02,414 INFO L168 Benchmark]: Toolchain (without parser) took 1403.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -132.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:02,415 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:02,415 INFO L168 Benchmark]: CACSL2BoogieTranslator took 515.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:02,416 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:02,416 INFO L168 Benchmark]: Boogie Preprocessor took 36.35 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-10-22 11:22:02,417 INFO L168 Benchmark]: RCFGBuilder took 486.85 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: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:02,417 INFO L168 Benchmark]: TraceAbstraction took 314.23 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:02,420 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 515.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.35 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 486.85 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: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 314.23 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort FloatRoundingMode not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort FloatRoundingMode not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...