./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_7edda1eb-842f-4eae-9d9c-1ad4698867d4/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7edda1eb-842f-4eae-9d9c-1ad4698867d4/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7edda1eb-842f-4eae-9d9c-1ad4698867d4/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7edda1eb-842f-4eae-9d9c-1ad4698867d4/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-01-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7edda1eb-842f-4eae-9d9c-1ad4698867d4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7edda1eb-842f-4eae-9d9c-1ad4698867d4/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:23:45,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:45,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:45,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:45,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:45,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:45,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:45,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:45,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:45,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:45,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:45,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:45,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:45,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:45,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:45,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:45,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:46,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:46,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:46,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:46,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:46,015 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:46,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:46,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:46,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:46,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:46,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:46,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:46,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:46,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:46,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:46,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:46,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:46,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:46,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:46,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:46,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:46,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:46,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:46,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:46,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:46,035 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7edda1eb-842f-4eae-9d9c-1ad4698867d4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:23:46,047 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:46,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:46,056 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:46,056 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:46,056 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:46,057 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:46,057 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:23:46,057 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:46,057 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:46,057 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:23:46,057 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:23:46,058 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:46,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:46,058 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:46,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:23:46,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:46,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:46,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:46,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:46,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:46,060 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:46,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:46,060 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:46,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:46,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:46,060 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:46,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:46,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:46,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:46,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:46,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:46,061 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:23:46,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:23:46,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:46,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:46,061 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_7edda1eb-842f-4eae-9d9c-1ad4698867d4/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 ! call(__VERIFIER_error())) ) 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 -> b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd [2019-10-22 11:23:46,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:46,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:46,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:46,098 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:46,098 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:46,099 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7edda1eb-842f-4eae-9d9c-1ad4698867d4/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-01-1.i [2019-10-22 11:23:46,141 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7edda1eb-842f-4eae-9d9c-1ad4698867d4/bin/utaipan/data/a2ada0ed5/61fb2a41acc641338bdf8671c6e782dd/FLAGaa543e6f5 [2019-10-22 11:23:46,563 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:46,564 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7edda1eb-842f-4eae-9d9c-1ad4698867d4/sv-benchmarks/c/forester-heap/dll-01-1.i [2019-10-22 11:23:46,577 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7edda1eb-842f-4eae-9d9c-1ad4698867d4/bin/utaipan/data/a2ada0ed5/61fb2a41acc641338bdf8671c6e782dd/FLAGaa543e6f5 [2019-10-22 11:23:46,588 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7edda1eb-842f-4eae-9d9c-1ad4698867d4/bin/utaipan/data/a2ada0ed5/61fb2a41acc641338bdf8671c6e782dd [2019-10-22 11:23:46,590 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:46,591 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:46,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:46,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:46,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:46,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:46" (1/1) ... [2019-10-22 11:23:46,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db29549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:46, skipping insertion in model container [2019-10-22 11:23:46,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:46" (1/1) ... [2019-10-22 11:23:46,605 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:46,640 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:46,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:46,983 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:47,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:47,081 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:47,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47 WrapperNode [2019-10-22 11:23:47,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:47,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:47,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:47,082 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:47,090 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:23:47" (1/1) ... [2019-10-22 11:23:47,103 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:23:47" (1/1) ... [2019-10-22 11:23:47,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:47,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:47,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:47,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:47,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:47,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:47,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:47,159 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:47,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7edda1eb-842f-4eae-9d9c-1ad4698867d4/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:23:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:23:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:23:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:23:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:23:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:47,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:47,672 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:47,672 INFO L284 CfgBuilder]: Removed 34 assume(true) statements. [2019-10-22 11:23:47,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:47 BoogieIcfgContainer [2019-10-22 11:23:47,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:47,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:47,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:47,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:47,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:46" (1/3) ... [2019-10-22 11:23:47,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13844008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:47, skipping insertion in model container [2019-10-22 11:23:47,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (2/3) ... [2019-10-22 11:23:47,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13844008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:47, skipping insertion in model container [2019-10-22 11:23:47,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:47" (3/3) ... [2019-10-22 11:23:47,682 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2019-10-22 11:23:47,689 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:47,695 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-10-22 11:23:47,702 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-10-22 11:23:47,721 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:47,721 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:47,721 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:47,721 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:47,722 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:47,722 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:47,722 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:47,722 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:47,736 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2019-10-22 11:23:47,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-10-22 11:23:47,741 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:47,742 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-10-22 11:23:47,743 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:47,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:47,747 INFO L82 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2019-10-22 11:23:47,755 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:47,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138649015] [2019-10-22 11:23:47,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:47,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:47,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:47,878 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:23:47,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138649015] [2019-10-22 11:23:47,879 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:47,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:47,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231561981] [2019-10-22 11:23:47,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:47,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:47,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:47,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:47,899 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2019-10-22 11:23:47,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:47,955 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2019-10-22 11:23:47,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:47,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-10-22 11:23:47,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:47,967 INFO L225 Difference]: With dead ends: 180 [2019-10-22 11:23:47,967 INFO L226 Difference]: Without dead ends: 95 [2019-10-22 11:23:47,970 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:47,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-22 11:23:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2019-10-22 11:23:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-22 11:23:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-10-22 11:23:48,015 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2019-10-22 11:23:48,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:48,015 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-10-22 11:23:48,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-10-22 11:23:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:23:48,016 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:48,017 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:48,017 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:48,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:48,017 INFO L82 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2019-10-22 11:23:48,018 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:48,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137929062] [2019-10-22 11:23:48,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:48,071 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:23:48,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137929062] [2019-10-22 11:23:48,071 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:48,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:48,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843373739] [2019-10-22 11:23:48,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:48,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:48,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:48,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:48,074 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 3 states. [2019-10-22 11:23:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:48,104 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-10-22 11:23:48,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:48,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-22 11:23:48,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:48,107 INFO L225 Difference]: With dead ends: 80 [2019-10-22 11:23:48,107 INFO L226 Difference]: Without dead ends: 78 [2019-10-22 11:23:48,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:48,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-22 11:23:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-22 11:23:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-22 11:23:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2019-10-22 11:23:48,118 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2019-10-22 11:23:48,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:48,118 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2019-10-22 11:23:48,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:48,119 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2019-10-22 11:23:48,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:23:48,119 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:48,119 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:48,120 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:48,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:48,120 INFO L82 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2019-10-22 11:23:48,120 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:48,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817149984] [2019-10-22 11:23:48,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:48,217 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:23:48,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817149984] [2019-10-22 11:23:48,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:48,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:48,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255768857] [2019-10-22 11:23:48,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:48,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:48,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:48,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:48,219 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 4 states. [2019-10-22 11:23:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:48,289 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-10-22 11:23:48,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:48,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-22 11:23:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:48,290 INFO L225 Difference]: With dead ends: 79 [2019-10-22 11:23:48,290 INFO L226 Difference]: Without dead ends: 77 [2019-10-22 11:23:48,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-22 11:23:48,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-10-22 11:23:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 11:23:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2019-10-22 11:23:48,297 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2019-10-22 11:23:48,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:48,297 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2019-10-22 11:23:48,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:48,297 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2019-10-22 11:23:48,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:23:48,297 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:48,298 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:48,298 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:48,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:48,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2019-10-22 11:23:48,299 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:48,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395214551] [2019-10-22 11:23:48,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:48,373 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:23:48,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395214551] [2019-10-22 11:23:48,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:48,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:48,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291931075] [2019-10-22 11:23:48,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:48,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:48,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:48,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:48,375 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 4 states. [2019-10-22 11:23:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:48,508 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2019-10-22 11:23:48,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:48,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-22 11:23:48,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:48,509 INFO L225 Difference]: With dead ends: 195 [2019-10-22 11:23:48,510 INFO L226 Difference]: Without dead ends: 128 [2019-10-22 11:23:48,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:48,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-22 11:23:48,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 77. [2019-10-22 11:23:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-22 11:23:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-10-22 11:23:48,517 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 15 [2019-10-22 11:23:48,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:48,517 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-10-22 11:23:48,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-10-22 11:23:48,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:23:48,518 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:48,518 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:48,519 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:48,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:48,519 INFO L82 PathProgramCache]: Analyzing trace with hash 903272487, now seen corresponding path program 1 times [2019-10-22 11:23:48,519 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:48,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658710497] [2019-10-22 11:23:48,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:48,582 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:23:48,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658710497] [2019-10-22 11:23:48,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:48,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:48,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204007638] [2019-10-22 11:23:48,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:48,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:48,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:48,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:48,584 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 5 states. [2019-10-22 11:23:48,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:48,704 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2019-10-22 11:23:48,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:23:48,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-22 11:23:48,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:48,706 INFO L225 Difference]: With dead ends: 122 [2019-10-22 11:23:48,706 INFO L226 Difference]: Without dead ends: 118 [2019-10-22 11:23:48,707 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:23:48,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-22 11:23:48,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 73. [2019-10-22 11:23:48,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-22 11:23:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2019-10-22 11:23:48,712 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 15 [2019-10-22 11:23:48,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:48,713 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2019-10-22 11:23:48,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2019-10-22 11:23:48,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:23:48,713 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:48,713 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:48,714 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:48,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:48,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2019-10-22 11:23:48,715 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:48,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022753788] [2019-10-22 11:23:48,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:48,761 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:23:48,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022753788] [2019-10-22 11:23:48,761 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:48,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:48,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397205354] [2019-10-22 11:23:48,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:48,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:48,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:48,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:48,762 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 4 states. [2019-10-22 11:23:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:48,836 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2019-10-22 11:23:48,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:48,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-22 11:23:48,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:48,838 INFO L225 Difference]: With dead ends: 132 [2019-10-22 11:23:48,838 INFO L226 Difference]: Without dead ends: 112 [2019-10-22 11:23:48,838 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:48,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-22 11:23:48,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2019-10-22 11:23:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 11:23:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2019-10-22 11:23:48,846 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2019-10-22 11:23:48,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:48,846 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2019-10-22 11:23:48,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2019-10-22 11:23:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:23:48,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:48,847 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] [2019-10-22 11:23:48,848 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:48,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:48,848 INFO L82 PathProgramCache]: Analyzing trace with hash -940628212, now seen corresponding path program 1 times [2019-10-22 11:23:48,848 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:48,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214833745] [2019-10-22 11:23:48,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:48,890 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:23:48,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214833745] [2019-10-22 11:23:48,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:48,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:48,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976244080] [2019-10-22 11:23:48,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:48,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:48,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:48,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:48,891 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 3 states. [2019-10-22 11:23:48,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:48,903 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2019-10-22 11:23:48,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:48,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 11:23:48,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:48,904 INFO L225 Difference]: With dead ends: 137 [2019-10-22 11:23:48,905 INFO L226 Difference]: Without dead ends: 96 [2019-10-22 11:23:48,905 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:48,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-22 11:23:48,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2019-10-22 11:23:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 11:23:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-10-22 11:23:48,911 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2019-10-22 11:23:48,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:48,911 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-10-22 11:23:48,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-10-22 11:23:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:23:48,912 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:48,912 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:23:48,912 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:48,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:48,913 INFO L82 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2019-10-22 11:23:48,913 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:48,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058308338] [2019-10-22 11:23:48,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:48,940 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:23:48,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058308338] [2019-10-22 11:23:48,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:48,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:48,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433636150] [2019-10-22 11:23:48,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:48,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:48,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:48,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:48,943 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 3 states. [2019-10-22 11:23:48,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:48,967 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2019-10-22 11:23:48,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:48,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 11:23:48,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:48,968 INFO L225 Difference]: With dead ends: 75 [2019-10-22 11:23:48,968 INFO L226 Difference]: Without dead ends: 73 [2019-10-22 11:23:48,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-22 11:23:48,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-10-22 11:23:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-22 11:23:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-10-22 11:23:48,974 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2019-10-22 11:23:48,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:48,975 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-10-22 11:23:48,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-10-22 11:23:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:23:48,976 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:48,976 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:23:48,976 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:48,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:48,977 INFO L82 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2019-10-22 11:23:48,977 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:48,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099128095] [2019-10-22 11:23:48,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:49,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:23:49,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099128095] [2019-10-22 11:23:49,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:49,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:49,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665524844] [2019-10-22 11:23:49,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:49,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:49,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:49,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:49,022 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 4 states. [2019-10-22 11:23:49,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:49,089 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2019-10-22 11:23:49,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:49,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-10-22 11:23:49,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:49,090 INFO L225 Difference]: With dead ends: 74 [2019-10-22 11:23:49,090 INFO L226 Difference]: Without dead ends: 72 [2019-10-22 11:23:49,091 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:49,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-22 11:23:49,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-22 11:23:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-22 11:23:49,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2019-10-22 11:23:49,096 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2019-10-22 11:23:49,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:49,096 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2019-10-22 11:23:49,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:49,097 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2019-10-22 11:23:49,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:23:49,097 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:49,097 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, 1] [2019-10-22 11:23:49,098 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:49,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:49,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2019-10-22 11:23:49,098 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:49,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957981608] [2019-10-22 11:23:49,099 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:49,099 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:49,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:49,198 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:23:49,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957981608] [2019-10-22 11:23:49,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:49,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:23:49,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061712481] [2019-10-22 11:23:49,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:49,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:49,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:49,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:49,200 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand 6 states. [2019-10-22 11:23:49,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:49,431 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2019-10-22 11:23:49,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:23:49,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-22 11:23:49,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:49,432 INFO L225 Difference]: With dead ends: 175 [2019-10-22 11:23:49,432 INFO L226 Difference]: Without dead ends: 133 [2019-10-22 11:23:49,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:23:49,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-22 11:23:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2019-10-22 11:23:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-22 11:23:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2019-10-22 11:23:49,440 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 24 [2019-10-22 11:23:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:49,440 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2019-10-22 11:23:49,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2019-10-22 11:23:49,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:23:49,441 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:49,442 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, 1] [2019-10-22 11:23:49,442 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:49,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:49,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2019-10-22 11:23:49,443 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:49,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681914426] [2019-10-22 11:23:49,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:49,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:49,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:49,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681914426] [2019-10-22 11:23:49,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:49,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:23:49,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203054370] [2019-10-22 11:23:49,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:23:49,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:49,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:23:49,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:23:49,667 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand 8 states. [2019-10-22 11:23:50,290 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-22 11:23:50,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:50,455 INFO L93 Difference]: Finished difference Result 171 states and 192 transitions. [2019-10-22 11:23:50,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 11:23:50,456 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-10-22 11:23:50,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:50,459 INFO L225 Difference]: With dead ends: 171 [2019-10-22 11:23:50,459 INFO L226 Difference]: Without dead ends: 169 [2019-10-22 11:23:50,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:23:50,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-22 11:23:50,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 100. [2019-10-22 11:23:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-22 11:23:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2019-10-22 11:23:50,478 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 24 [2019-10-22 11:23:50,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:50,478 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2019-10-22 11:23:50,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:23:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2019-10-22 11:23:50,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:23:50,479 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:50,479 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, 1, 1, 1] [2019-10-22 11:23:50,479 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:50,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:50,479 INFO L82 PathProgramCache]: Analyzing trace with hash 680714775, now seen corresponding path program 1 times [2019-10-22 11:23:50,480 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:50,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136127293] [2019-10-22 11:23:50,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:50,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:50,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:23:50,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136127293] [2019-10-22 11:23:50,536 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:50,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:50,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24007742] [2019-10-22 11:23:50,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:50,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:50,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:50,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:50,537 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand 5 states. [2019-10-22 11:23:50,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:50,667 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2019-10-22 11:23:50,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:23:50,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-22 11:23:50,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:50,668 INFO L225 Difference]: With dead ends: 146 [2019-10-22 11:23:50,668 INFO L226 Difference]: Without dead ends: 128 [2019-10-22 11:23:50,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:50,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-22 11:23:50,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2019-10-22 11:23:50,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-22 11:23:50,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 143 transitions. [2019-10-22 11:23:50,679 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 143 transitions. Word has length 26 [2019-10-22 11:23:50,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:50,679 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 143 transitions. [2019-10-22 11:23:50,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 143 transitions. [2019-10-22 11:23:50,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:23:50,680 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:50,680 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, 1, 1, 1] [2019-10-22 11:23:50,681 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:50,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:50,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1502606953, now seen corresponding path program 1 times [2019-10-22 11:23:50,681 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:50,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456181256] [2019-10-22 11:23:50,681 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:50,682 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:50,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:23:50,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456181256] [2019-10-22 11:23:50,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:50,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:50,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103608675] [2019-10-22 11:23:50,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:50,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:50,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:50,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:50,714 INFO L87 Difference]: Start difference. First operand 120 states and 143 transitions. Second operand 3 states. [2019-10-22 11:23:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:50,760 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2019-10-22 11:23:50,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:50,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 11:23:50,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:50,761 INFO L225 Difference]: With dead ends: 120 [2019-10-22 11:23:50,761 INFO L226 Difference]: Without dead ends: 118 [2019-10-22 11:23:50,761 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:50,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-22 11:23:50,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-10-22 11:23:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-22 11:23:50,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2019-10-22 11:23:50,768 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 26 [2019-10-22 11:23:50,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:50,768 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-10-22 11:23:50,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:50,768 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2019-10-22 11:23:50,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:23:50,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:50,769 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, 1, 1, 1, 1] [2019-10-22 11:23:50,769 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:50,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:50,770 INFO L82 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2019-10-22 11:23:50,770 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:50,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049314597] [2019-10-22 11:23:50,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:50,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:50,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:23:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:23:50,819 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:23:50,819 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:23:50,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:23:50 BoogieIcfgContainer [2019-10-22 11:23:50,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:23:50,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:23:50,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:23:50,858 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:23:50,859 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:47" (3/4) ... [2019-10-22 11:23:50,861 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:23:50,913 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7edda1eb-842f-4eae-9d9c-1ad4698867d4/bin/utaipan/witness.graphml [2019-10-22 11:23:50,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:23:50,914 INFO L168 Benchmark]: Toolchain (without parser) took 4323.15 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.6 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 49.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:50,915 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:50,915 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -182.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:50,916 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.55 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:50,916 INFO L168 Benchmark]: Boogie Preprocessor took 32.09 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:50,916 INFO L168 Benchmark]: RCFGBuilder took 515.25 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: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:50,917 INFO L168 Benchmark]: TraceAbstraction took 3181.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -50.9 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:50,917 INFO L168 Benchmark]: Witness Printer took 54.94 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:50,919 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 489.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -182.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.55 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.09 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 515.25 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: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3181.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -50.9 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * Witness Printer took 54.94 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L992] SLL* list = malloc(sizeof(SLL)); [L993] list->next = ((void*)0) [L994] list->prev = ((void*)0) [L995] COND FALSE !(!(list != ((void*)0))) [L995] COND FALSE !(__VERIFIER_nondet_int()) [L995] list->inner = malloc(sizeof(SLL)) [L995] EXPR list->inner [L995] list->inner->next = ((void*)0) [L995] EXPR list->inner [L995] list->inner->inner = ((void*)0) [L995] EXPR list->inner [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L997] SLL* end = list; [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list [L1015] COND FALSE !(!(((void*)0) != end)) [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; [L1020] EXPR end->inner [L1020] SLL* inner = end->inner; [L1021] COND TRUE ((void*)0) != inner [L1023] COND TRUE len == 0 [L1024] len = 1 [L1027] COND FALSE !(!(((void*)0) != inner)) [L1028] EXPR inner->inner [L1028] COND FALSE !(!(((void*)0) == inner->inner)) [L1029] EXPR inner->next [L1029] COND TRUE !(((void*)0) != inner->next) [L1029] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 83 locations, 13 error locations. Result: UNSAFE, OverallTime: 3.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 914 SDtfs, 940 SDslu, 1206 SDs, 0 SdLazy, 618 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 307 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 35681 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...