./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/rule60_list2.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_936bac43-8589-4b62-9649-010a47b86fe8/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_936bac43-8589-4b62-9649-010a47b86fe8/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_936bac43-8589-4b62-9649-010a47b86fe8/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_936bac43-8589-4b62-9649-010a47b86fe8/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/rule60_list2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_936bac43-8589-4b62-9649-010a47b86fe8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_936bac43-8589-4b62-9649-010a47b86fe8/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 10cd30ad3ca5cbac349bf58887b96141941b6c91 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:22:18,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:18,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:18,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:18,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:18,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:18,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:18,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:18,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:18,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:18,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:18,400 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:18,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:18,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:18,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:18,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:18,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:18,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:18,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:18,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:18,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:18,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:18,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:18,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:18,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:18,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:18,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:18,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:18,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:18,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:18,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:18,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:18,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:18,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:18,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:18,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:18,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:18,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:18,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:18,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:18,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:18,421 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_936bac43-8589-4b62-9649-010a47b86fe8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:22:18,432 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:18,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:18,433 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:18,434 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:18,434 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:18,434 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:18,434 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:22:18,434 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:18,435 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:18,435 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:22:18,435 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:22:18,435 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:18,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:18,436 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:18,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:22:18,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:18,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:18,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:22:18,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:18,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:22:18,437 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:18,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:22:18,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:22:18,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:18,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:18,439 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:18,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:18,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:18,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:18,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:18,439 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:22:18,440 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:22:18,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:22:18,440 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:22:18,440 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:18,440 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_936bac43-8589-4b62-9649-010a47b86fe8/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 -> 10cd30ad3ca5cbac349bf58887b96141941b6c91 [2019-10-22 11:22:18,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:18,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:18,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:18,479 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:18,480 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:18,480 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_936bac43-8589-4b62-9649-010a47b86fe8/bin/utaipan/../../sv-benchmarks/c/ldv-regression/rule60_list2.i [2019-10-22 11:22:18,529 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_936bac43-8589-4b62-9649-010a47b86fe8/bin/utaipan/data/bfdc9a009/5c03d6bfa3c8446d8389f53b0b4021d0/FLAG0208682d5 [2019-10-22 11:22:18,965 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:18,965 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_936bac43-8589-4b62-9649-010a47b86fe8/sv-benchmarks/c/ldv-regression/rule60_list2.i [2019-10-22 11:22:18,974 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_936bac43-8589-4b62-9649-010a47b86fe8/bin/utaipan/data/bfdc9a009/5c03d6bfa3c8446d8389f53b0b4021d0/FLAG0208682d5 [2019-10-22 11:22:19,317 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_936bac43-8589-4b62-9649-010a47b86fe8/bin/utaipan/data/bfdc9a009/5c03d6bfa3c8446d8389f53b0b4021d0 [2019-10-22 11:22:19,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:19,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:19,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:19,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:19,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:19,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:19" (1/1) ... [2019-10-22 11:22:19,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e51859d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:19, skipping insertion in model container [2019-10-22 11:22:19,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:19" (1/1) ... [2019-10-22 11:22:19,342 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:19,384 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:19,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:19,758 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:19,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:19,854 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:19,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:19 WrapperNode [2019-10-22 11:22:19,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:19,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:19,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:19,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:19,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:19" (1/1) ... [2019-10-22 11:22:19,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:19" (1/1) ... [2019-10-22 11:22:19,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:19,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:19,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:19,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:19,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:19" (1/1) ... [2019-10-22 11:22:19,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:19" (1/1) ... [2019-10-22 11:22:19,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:19" (1/1) ... [2019-10-22 11:22:19,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:19" (1/1) ... [2019-10-22 11:22:19,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:19" (1/1) ... [2019-10-22 11:22:19,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:19" (1/1) ... [2019-10-22 11:22:19,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:19" (1/1) ... [2019-10-22 11:22:19,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:19,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:19,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:19,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:19,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_936bac43-8589-4b62-9649-010a47b86fe8/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:19,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:22:19,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:22:19,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:19,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:20,310 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:20,311 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-10-22 11:22:20,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:20 BoogieIcfgContainer [2019-10-22 11:22:20,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:20,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:20,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:20,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:20,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:19" (1/3) ... [2019-10-22 11:22:20,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5501fe0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:20, skipping insertion in model container [2019-10-22 11:22:20,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:19" (2/3) ... [2019-10-22 11:22:20,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5501fe0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:20, skipping insertion in model container [2019-10-22 11:22:20,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:20" (3/3) ... [2019-10-22 11:22:20,327 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2019-10-22 11:22:20,338 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:20,347 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-22 11:22:20,359 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-22 11:22:20,388 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:20,389 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:22:20,389 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:20,389 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:20,389 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:20,389 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:20,389 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:20,390 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:20,410 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-10-22 11:22:20,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-10-22 11:22:20,418 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:20,419 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-10-22 11:22:20,421 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:20,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:20,428 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 11:22:20,437 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:20,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439882844] [2019-10-22 11:22:20,437 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:20,437 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:20,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:20,595 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:22:20,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439882844] [2019-10-22 11:22:20,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:20,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:20,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793576999] [2019-10-22 11:22:20,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:20,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:20,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:20,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:20,612 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-10-22 11:22:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:20,642 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2019-10-22 11:22:20,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:20,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-10-22 11:22:20,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:20,653 INFO L225 Difference]: With dead ends: 73 [2019-10-22 11:22:20,653 INFO L226 Difference]: Without dead ends: 30 [2019-10-22 11:22:20,656 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:22:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-22 11:22:20,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-22 11:22:20,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 11:22:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-22 11:22:20,689 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 4 [2019-10-22 11:22:20,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:20,689 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-22 11:22:20,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:20,689 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-22 11:22:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:22:20,690 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:20,690 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:20,691 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:20,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:20,691 INFO L82 PathProgramCache]: Analyzing trace with hash 170685048, now seen corresponding path program 1 times [2019-10-22 11:22:20,692 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:20,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810970057] [2019-10-22 11:22:20,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:20,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:20,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:20,772 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:22:20,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810970057] [2019-10-22 11:22:20,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:20,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:20,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736761840] [2019-10-22 11:22:20,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:20,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:20,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:20,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:20,776 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-10-22 11:22:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:20,868 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-10-22 11:22:20,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:20,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-22 11:22:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:20,869 INFO L225 Difference]: With dead ends: 52 [2019-10-22 11:22:20,870 INFO L226 Difference]: Without dead ends: 32 [2019-10-22 11:22:20,870 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:22:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-22 11:22:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-10-22 11:22:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 11:22:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-10-22 11:22:20,875 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2019-10-22 11:22:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:20,875 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-10-22 11:22:20,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-10-22 11:22:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:22:20,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:20,876 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:20,876 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:20,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:20,877 INFO L82 PathProgramCache]: Analyzing trace with hash 227943350, now seen corresponding path program 1 times [2019-10-22 11:22:20,877 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:20,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838657674] [2019-10-22 11:22:20,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:20,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:20,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:21,012 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:22:21,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838657674] [2019-10-22 11:22:21,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:21,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:22:21,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239535576] [2019-10-22 11:22:21,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:22:21,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:21,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:22:21,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:21,014 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 7 states. [2019-10-22 11:22:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:21,182 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-10-22 11:22:21,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:22:21,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-10-22 11:22:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:21,184 INFO L225 Difference]: With dead ends: 42 [2019-10-22 11:22:21,185 INFO L226 Difference]: Without dead ends: 40 [2019-10-22 11:22:21,185 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:22:21,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-22 11:22:21,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2019-10-22 11:22:21,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 11:22:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-10-22 11:22:21,189 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2019-10-22 11:22:21,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:21,189 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-10-22 11:22:21,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:22:21,189 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-10-22 11:22:21,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:22:21,189 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:21,189 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:21,190 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:21,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:21,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1186712674, now seen corresponding path program 1 times [2019-10-22 11:22:21,190 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:21,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248014610] [2019-10-22 11:22:21,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:21,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:21,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:21,244 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:22:21,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248014610] [2019-10-22 11:22:21,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:21,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:21,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863703083] [2019-10-22 11:22:21,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:21,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:21,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:21,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:21,246 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2019-10-22 11:22:21,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:21,298 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-10-22 11:22:21,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:21,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-22 11:22:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:21,301 INFO L225 Difference]: With dead ends: 51 [2019-10-22 11:22:21,301 INFO L226 Difference]: Without dead ends: 28 [2019-10-22 11:22:21,301 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:21,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-22 11:22:21,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-22 11:22:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 11:22:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-10-22 11:22:21,305 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 19 [2019-10-22 11:22:21,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:21,305 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-10-22 11:22:21,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:21,305 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-10-22 11:22:21,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:22:21,306 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:21,308 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:21,308 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:21,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:21,309 INFO L82 PathProgramCache]: Analyzing trace with hash -93151004, now seen corresponding path program 1 times [2019-10-22 11:22:21,309 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:21,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751743754] [2019-10-22 11:22:21,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:21,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:21,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:21,464 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:22:21,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751743754] [2019-10-22 11:22:21,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:21,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-22 11:22:21,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382344871] [2019-10-22 11:22:21,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 11:22:21,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:21,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 11:22:21,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:22:21,466 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 12 states. [2019-10-22 11:22:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:21,728 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-10-22 11:22:21,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:22:21,729 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-10-22 11:22:21,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:21,729 INFO L225 Difference]: With dead ends: 38 [2019-10-22 11:22:21,729 INFO L226 Difference]: Without dead ends: 36 [2019-10-22 11:22:21,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:22:21,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-22 11:22:21,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-10-22 11:22:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 11:22:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-10-22 11:22:21,735 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 19 [2019-10-22 11:22:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:21,735 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-10-22 11:22:21,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 11:22:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-10-22 11:22:21,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:22:21,736 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:21,736 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:21,736 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:21,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:21,736 INFO L82 PathProgramCache]: Analyzing trace with hash -93091422, now seen corresponding path program 1 times [2019-10-22 11:22:21,737 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:21,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305655026] [2019-10-22 11:22:21,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:21,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:21,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:21,859 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:22:21,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305655026] [2019-10-22 11:22:21,859 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:21,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:22:21,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916466532] [2019-10-22 11:22:21,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:22:21,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:21,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:22:21,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:21,861 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 8 states. [2019-10-22 11:22:22,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:22,026 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-10-22 11:22:22,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:22:22,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-10-22 11:22:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:22,028 INFO L225 Difference]: With dead ends: 38 [2019-10-22 11:22:22,028 INFO L226 Difference]: Without dead ends: 36 [2019-10-22 11:22:22,028 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:22:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-22 11:22:22,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-10-22 11:22:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 11:22:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-10-22 11:22:22,032 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2019-10-22 11:22:22,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:22,033 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-10-22 11:22:22,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:22:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-10-22 11:22:22,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:22:22,033 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:22,033 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] [2019-10-22 11:22:22,034 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:22,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:22,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1793070580, now seen corresponding path program 1 times [2019-10-22 11:22:22,035 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:22,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079381920] [2019-10-22 11:22:22,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:22,150 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:22:22,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079381920] [2019-10-22 11:22:22,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:22,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:22:22,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417492649] [2019-10-22 11:22:22,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:22:22,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:22,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:22:22,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:22:22,152 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 10 states. [2019-10-22 11:22:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:22,376 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-10-22 11:22:22,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:22:22,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-10-22 11:22:22,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:22,377 INFO L225 Difference]: With dead ends: 38 [2019-10-22 11:22:22,377 INFO L226 Difference]: Without dead ends: 30 [2019-10-22 11:22:22,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:22:22,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-22 11:22:22,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-22 11:22:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 11:22:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-10-22 11:22:22,380 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2019-10-22 11:22:22,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:22,380 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-10-22 11:22:22,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:22:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-10-22 11:22:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:22:22,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:22,381 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] [2019-10-22 11:22:22,381 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:22,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:22,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1793130162, now seen corresponding path program 1 times [2019-10-22 11:22:22,381 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:22,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765532912] [2019-10-22 11:22:22,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:22,522 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:22:22,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765532912] [2019-10-22 11:22:22,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:22,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-22 11:22:22,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630231223] [2019-10-22 11:22:22,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 11:22:22,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:22,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 11:22:22,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:22:22,524 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 14 states. [2019-10-22 11:22:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:22,801 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-10-22 11:22:22,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:22:22,801 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-10-22 11:22:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:22,801 INFO L225 Difference]: With dead ends: 40 [2019-10-22 11:22:22,801 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:22:22,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2019-10-22 11:22:22,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:22:22,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-10-22 11:22:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 11:22:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-10-22 11:22:22,810 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 25 [2019-10-22 11:22:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:22,810 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-10-22 11:22:22,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 11:22:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-10-22 11:22:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:22:22,811 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:22,811 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] [2019-10-22 11:22:22,811 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:22,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:22,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1850388464, now seen corresponding path program 1 times [2019-10-22 11:22:22,812 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:22,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285709962] [2019-10-22 11:22:22,812 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,812 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:22,872 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:22:22,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285709962] [2019-10-22 11:22:22,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:22,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:22,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332958974] [2019-10-22 11:22:22,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:22,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:22,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:22,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:22,873 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 5 states. [2019-10-22 11:22:22,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:22,912 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2019-10-22 11:22:22,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:22,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-22 11:22:22,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:22,915 INFO L225 Difference]: With dead ends: 36 [2019-10-22 11:22:22,915 INFO L226 Difference]: Without dead ends: 26 [2019-10-22 11:22:22,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-22 11:22:22,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-22 11:22:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 11:22:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2019-10-22 11:22:22,918 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 25 [2019-10-22 11:22:22,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:22,918 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2019-10-22 11:22:22,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:22,918 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2019-10-22 11:22:22,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:22:22,919 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:22,919 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] [2019-10-22 11:22:22,919 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:22,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:22,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1400103152, now seen corresponding path program 1 times [2019-10-22 11:22:22,920 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:22,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492076334] [2019-10-22 11:22:22,920 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,920 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:23,011 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:22:23,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492076334] [2019-10-22 11:22:23,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:23,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-22 11:22:23,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318261759] [2019-10-22 11:22:23,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-22 11:22:23,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:23,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 11:22:23,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:22:23,013 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand 13 states. [2019-10-22 11:22:23,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:23,252 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2019-10-22 11:22:23,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 11:22:23,252 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-10-22 11:22:23,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:23,253 INFO L225 Difference]: With dead ends: 26 [2019-10-22 11:22:23,253 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:22:23,253 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-10-22 11:22:23,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:22:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:22:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:22:23,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:22:23,254 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-10-22 11:22:23,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:23,254 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:22:23,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-22 11:22:23,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:22:23,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:22:23,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:22:23,558 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 898) no Hoare annotation was computed. [2019-10-22 11:22:23,558 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:22:23,559 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:22:23,559 INFO L439 ceAbstractionStarter]: At program point L879(lines 878 880) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse1 (= 0 ~guard_malloc_counter~0.base)) (.cse2 (= 0 |ULTIMATE.start_my_malloc_#res.base|)) (.cse3 (= ~elem~0.offset 0))) (or (and (= |ULTIMATE.start___getMemory_#res.offset| 0) (= 0 |ULTIMATE.start_my_malloc_#res.offset|) .cse0 (= 0 |ULTIMATE.start___getMemory_#res.base|) .cse1 .cse2 .cse3) (and (<= 1 |ULTIMATE.start_my_malloc_#res.offset|) .cse0 (= ~elem~0.base |ULTIMATE.start_my_malloc_#res.base|) (<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset) .cse1 .cse2 (<= 1 |ULTIMATE.start___getMemory_#res.offset|) .cse3 (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.base |ULTIMATE.start___getMemory_#res.base|)))) [2019-10-22 11:22:23,559 INFO L439 ceAbstractionStarter]: At program point L879-1(lines 878 880) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse1 (= 0 |ULTIMATE.start___getMemory_#res.base|)) (.cse4 (= 0 ~guard_malloc_counter~0.base)) (.cse2 (= 0 |ULTIMATE.start_my_malloc_#res.base|)) (.cse5 (= ~elem~0.offset 0))) (or (and (= |ULTIMATE.start___getMemory_#res.offset| 0) (= 0 |ULTIMATE.start_my_malloc_#res.offset|) .cse0 .cse1 .cse2) (let ((.cse3 (+ ULTIMATE.start_main_~dev1~0.offset 1))) (and (= |ULTIMATE.start___getMemory_#res.base| ULTIMATE.start_main_~dev1~0.base) (<= 1 ULTIMATE.start_main_~dev1~0.offset) (<= .cse3 |ULTIMATE.start_my_malloc_#res.offset|) .cse0 (= ~elem~0.base |ULTIMATE.start_my_malloc_#res.base|) (<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset) .cse4 .cse2 .cse5 (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.base |ULTIMATE.start___getMemory_#res.base|) (<= .cse3 |ULTIMATE.start___getMemory_#res.offset|))) (and (= 0 ULTIMATE.start_main_~dev1~0.base) .cse0 .cse1 .cse4 .cse2 .cse5 (= ULTIMATE.start_main_~dev1~0.offset 0)))) [2019-10-22 11:22:23,559 INFO L443 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2019-10-22 11:22:23,559 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-10-22 11:22:23,560 INFO L443 ceAbstractionStarter]: For program point L871-2(line 871) no Hoare annotation was computed. [2019-10-22 11:22:23,560 INFO L443 ceAbstractionStarter]: For program point L4(lines 1 917) no Hoare annotation was computed. [2019-10-22 11:22:23,560 INFO L443 ceAbstractionStarter]: For program point L4-1(lines 1 917) no Hoare annotation was computed. [2019-10-22 11:22:23,560 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 1 917) no Hoare annotation was computed. [2019-10-22 11:22:23,560 INFO L443 ceAbstractionStarter]: For program point L4-3(lines 1 917) no Hoare annotation was computed. [2019-10-22 11:22:23,560 INFO L443 ceAbstractionStarter]: For program point L896(lines 896 897) no Hoare annotation was computed. [2019-10-22 11:22:23,560 INFO L443 ceAbstractionStarter]: For program point L4-4(lines 1 917) no Hoare annotation was computed. [2019-10-22 11:22:23,560 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 893) no Hoare annotation was computed. [2019-10-22 11:22:23,560 INFO L443 ceAbstractionStarter]: For program point L889-1(lines 889 893) no Hoare annotation was computed. [2019-10-22 11:22:23,560 INFO L443 ceAbstractionStarter]: For program point L906(lines 906 915) no Hoare annotation was computed. [2019-10-22 11:22:23,560 INFO L443 ceAbstractionStarter]: For program point L873(lines 873 874) no Hoare annotation was computed. [2019-10-22 11:22:23,560 INFO L443 ceAbstractionStarter]: For program point L906-1(lines 906 915) no Hoare annotation was computed. [2019-10-22 11:22:23,560 INFO L443 ceAbstractionStarter]: For program point L873-1(lines 873 874) no Hoare annotation was computed. [2019-10-22 11:22:23,560 INFO L443 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2019-10-22 11:22:23,561 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-10-22 11:22:23,561 INFO L443 ceAbstractionStarter]: For program point L6-1(line 6) no Hoare annotation was computed. [2019-10-22 11:22:23,561 INFO L443 ceAbstractionStarter]: For program point L6-2(line 6) no Hoare annotation was computed. [2019-10-22 11:22:23,561 INFO L443 ceAbstractionStarter]: For program point L6-3(line 6) no Hoare annotation was computed. [2019-10-22 11:22:23,561 INFO L443 ceAbstractionStarter]: For program point L6-4(line 6) no Hoare annotation was computed. [2019-10-22 11:22:23,561 INFO L443 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2019-10-22 11:22:23,561 INFO L443 ceAbstractionStarter]: For program point L890-2(line 890) no Hoare annotation was computed. [2019-10-22 11:22:23,561 INFO L443 ceAbstractionStarter]: For program point L890-4(line 890) no Hoare annotation was computed. [2019-10-22 11:22:23,561 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-10-22 11:22:23,561 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:22:23,561 INFO L443 ceAbstractionStarter]: For program point L891(lines 891 892) no Hoare annotation was computed. [2019-10-22 11:22:23,561 INFO L443 ceAbstractionStarter]: For program point L891-2(lines 891 892) no Hoare annotation was computed. [2019-10-22 11:22:23,561 INFO L443 ceAbstractionStarter]: For program point L891-4(lines 891 892) no Hoare annotation was computed. [2019-10-22 11:22:23,561 INFO L439 ceAbstractionStarter]: At program point L916(lines 902 917) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2019-10-22 11:22:23,562 INFO L439 ceAbstractionStarter]: At program point L875(lines 869 876) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse1 (= 0 |ULTIMATE.start___getMemory_#res.base|)) (.cse2 (= 0 ~guard_malloc_counter~0.base)) (.cse3 (= ~elem~0.offset 0))) (or (and (= |ULTIMATE.start___getMemory_#res.offset| 0) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start___getMemory_#res.offset|) .cse3 (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.base |ULTIMATE.start___getMemory_#res.base|)))) [2019-10-22 11:22:23,562 INFO L439 ceAbstractionStarter]: At program point L875-1(lines 869 876) the Hoare annotation is: (let ((.cse1 (= 0 |ULTIMATE.start___getMemory_#res.base|)) (.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse2 (= 0 ~guard_malloc_counter~0.base)) (.cse3 (= ~elem~0.offset 0))) (or (and (= |ULTIMATE.start___getMemory_#res.offset| 0) .cse0 .cse1) (and (= 0 ULTIMATE.start_main_~dev1~0.base) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~dev1~0.offset 0)) (and (= |ULTIMATE.start___getMemory_#res.base| ULTIMATE.start_main_~dev1~0.base) .cse1 (<= 1 ULTIMATE.start_main_~dev1~0.offset) .cse0 .cse2 .cse3 (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.base |ULTIMATE.start___getMemory_#res.base|) (<= (+ ULTIMATE.start_main_~dev1~0.offset 1) |ULTIMATE.start___getMemory_#res.offset|)))) [2019-10-22 11:22:23,562 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:22:23,562 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-10-22 11:22:23,562 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-10-22 11:22:23,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:22:23 BoogieIcfgContainer [2019-10-22 11:22:23,585 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:22:23,585 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:22:23,585 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:22:23,585 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:22:23,586 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:20" (3/4) ... [2019-10-22 11:22:23,588 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:22:23,598 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-10-22 11:22:23,599 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-10-22 11:22:23,622 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 0 && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && elem == 0) || ((((((size == 8 && 0 == \result) && 0 == guard_malloc_counter) && 1 <= \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) [2019-10-22 11:22:23,622 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\result == 0 && 0 == \result) && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && 0 == \result) && elem == 0) || (((((((((1 <= \result && size == 8) && elem == \result) && \result <= guard_malloc_counter) && 0 == guard_malloc_counter) && 0 == \result) && 1 <= \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) [2019-10-22 11:22:23,622 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && size == 8) && 0 == \result) || (((((0 == dev1 && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && elem == 0) && dev1 == 0)) || ((((((((\result == dev1 && 0 == \result) && 1 <= dev1) && size == 8) && 0 == guard_malloc_counter) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) && dev1 + 1 <= \result) [2019-10-22 11:22:23,622 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && 0 == \result) && size == 8) && 0 == \result) && 0 == \result) || (((((((((((\result == dev1 && 1 <= dev1) && dev1 + 1 <= \result) && size == 8) && elem == \result) && \result <= guard_malloc_counter) && 0 == guard_malloc_counter) && 0 == \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) && dev1 + 1 <= \result)) || ((((((0 == dev1 && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && 0 == \result) && elem == 0) && dev1 == 0) [2019-10-22 11:22:23,649 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_936bac43-8589-4b62-9649-010a47b86fe8/bin/utaipan/witness.graphml [2019-10-22 11:22:23,650 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:22:23,652 INFO L168 Benchmark]: Toolchain (without parser) took 4330.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 935.6 MB in the beginning and 1.2 GB in the end (delta: -225.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:23,652 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:23,652 INFO L168 Benchmark]: CACSL2BoogieTranslator took 533.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:23,653 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:23,653 INFO L168 Benchmark]: Boogie Preprocessor took 27.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:23,653 INFO L168 Benchmark]: RCFGBuilder took 385.82 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:23,654 INFO L168 Benchmark]: TraceAbstraction took 3271.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.1 MB). Peak memory consumption was 215.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:23,654 INFO L168 Benchmark]: Witness Printer took 64.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:23,661 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 533.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 385.82 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3271.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.1 MB). Peak memory consumption was 215.9 MB. Max. memory is 11.5 GB. * Witness Printer took 64.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 902]: Loop Invariant Derived loop invariant: size == 8 - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: (((((\result == 0 && 0 == \result) && size == 8) && 0 == \result) && 0 == \result) || (((((((((((\result == dev1 && 1 <= dev1) && dev1 + 1 <= \result) && size == 8) && elem == \result) && \result <= guard_malloc_counter) && 0 == guard_malloc_counter) && 0 == \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) && dev1 + 1 <= \result)) || ((((((0 == dev1 && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && 0 == \result) && elem == 0) && dev1 == 0) - InvariantResult [Line: 869]: Loop Invariant Derived loop invariant: ((((\result == 0 && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && elem == 0) || ((((((size == 8 && 0 == \result) && 0 == guard_malloc_counter) && 1 <= \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) - InvariantResult [Line: 869]: Loop Invariant Derived loop invariant: (((\result == 0 && size == 8) && 0 == \result) || (((((0 == dev1 && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && elem == 0) && dev1 == 0)) || ((((((((\result == dev1 && 0 == \result) && 1 <= dev1) && size == 8) && 0 == guard_malloc_counter) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) && dev1 + 1 <= \result) - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: ((((((\result == 0 && 0 == \result) && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && 0 == \result) && elem == 0) || (((((((((1 <= \result && size == 8) && elem == \result) && \result <= guard_malloc_counter) && 0 == guard_malloc_counter) && 0 == \result) && 1 <= \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 5 error locations. Result: SAFE, OverallTime: 3.1s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 224 SDtfs, 658 SDslu, 521 SDs, 0 SdLazy, 804 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 34 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 16 NumberOfFragments, 236 HoareAnnotationTreeSize, 5 FomulaSimplifications, 56 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 57 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 15085 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...