./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label02.c -s /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/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 14021e9fff9123a734a262a9d34c71e4922bd817 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 21:06:59,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:06:59,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:06:59,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:06:59,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:06:59,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:06:59,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:06:59,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:06:59,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:06:59,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:06:59,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:06:59,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:06:59,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:06:59,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:06:59,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:06:59,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:06:59,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:06:59,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:06:59,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:06:59,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:06:59,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:06:59,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:06:59,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:06:59,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:06:59,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:06:59,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:06:59,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:06:59,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:06:59,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:06:59,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:06:59,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:06:59,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:06:59,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:06:59,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:06:59,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:06:59,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:06:59,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:06:59,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:06:59,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:06:59,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:06:59,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:06:59,548 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:06:59,558 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:06:59,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:06:59,559 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:06:59,559 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:06:59,559 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:06:59,559 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:06:59,560 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:06:59,560 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:06:59,560 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:06:59,560 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:06:59,560 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:06:59,560 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:06:59,560 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:06:59,561 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:06:59,561 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:06:59,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:06:59,561 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:06:59,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:06:59,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:06:59,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:06:59,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:06:59,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:06:59,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:06:59,562 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:06:59,562 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:06:59,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:06:59,563 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:06:59,563 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:06:59,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:06:59,563 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:06:59,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:06:59,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:06:59,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:06:59,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:06:59,564 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:06:59,564 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:06:59,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:06:59,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:06:59,564 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:06:59,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:06:59,564 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/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 -> 14021e9fff9123a734a262a9d34c71e4922bd817 [2019-12-07 21:06:59,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:06:59,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:06:59,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:06:59,676 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:06:59,676 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:06:59,677 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem03_label02.c [2019-12-07 21:06:59,715 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/bin/utaipan/data/356b59cc9/a9057bf940454d07b4c4774e29a1052a/FLAG6db5af145 [2019-12-07 21:07:00,176 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:07:00,177 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/sv-benchmarks/c/eca-rers2012/Problem03_label02.c [2019-12-07 21:07:00,190 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/bin/utaipan/data/356b59cc9/a9057bf940454d07b4c4774e29a1052a/FLAG6db5af145 [2019-12-07 21:07:00,491 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/bin/utaipan/data/356b59cc9/a9057bf940454d07b4c4774e29a1052a [2019-12-07 21:07:00,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:07:00,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:07:00,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:07:00,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:07:00,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:07:00,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:07:00" (1/1) ... [2019-12-07 21:07:00,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581f3bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:00, skipping insertion in model container [2019-12-07 21:07:00,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:07:00" (1/1) ... [2019-12-07 21:07:00,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:07:00,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:07:00,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:07:00,975 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:07:01,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:07:01,126 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:07:01,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:01 WrapperNode [2019-12-07 21:07:01,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:07:01,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:07:01,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:07:01,127 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:07:01,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:01" (1/1) ... [2019-12-07 21:07:01,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:01" (1/1) ... [2019-12-07 21:07:01,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:07:01,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:07:01,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:07:01,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:07:01,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:01" (1/1) ... [2019-12-07 21:07:01,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:01" (1/1) ... [2019-12-07 21:07:01,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:01" (1/1) ... [2019-12-07 21:07:01,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:01" (1/1) ... [2019-12-07 21:07:01,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:01" (1/1) ... [2019-12-07 21:07:01,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:01" (1/1) ... [2019-12-07 21:07:01,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:01" (1/1) ... [2019-12-07 21:07:01,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:07:01,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:07:01,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:07:01,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:07:01,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:07:01,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:07:01,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:07:03,037 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:07:03,038 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 21:07:03,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:07:03 BoogieIcfgContainer [2019-12-07 21:07:03,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:07:03,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:07:03,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:07:03,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:07:03,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:07:00" (1/3) ... [2019-12-07 21:07:03,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef133bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:07:03, skipping insertion in model container [2019-12-07 21:07:03,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:07:01" (2/3) ... [2019-12-07 21:07:03,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef133bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:07:03, skipping insertion in model container [2019-12-07 21:07:03,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:07:03" (3/3) ... [2019-12-07 21:07:03,043 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label02.c [2019-12-07 21:07:03,050 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:07:03,055 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 21:07:03,062 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 21:07:03,081 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:07:03,081 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:07:03,081 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:07:03,081 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:07:03,082 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:07:03,082 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:07:03,082 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:07:03,082 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:07:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-12-07 21:07:03,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 21:07:03,106 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:03,107 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:07:03,107 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:03,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:03,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1467437535, now seen corresponding path program 1 times [2019-12-07 21:07:03,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:03,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029300728] [2019-12-07 21:07:03,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:07:03,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029300728] [2019-12-07 21:07:03,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:03,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:07:03,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083764198] [2019-12-07 21:07:03,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:07:03,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:03,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:07:03,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:07:03,520 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-12-07 21:07:04,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:04,764 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-12-07 21:07:04,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:07:04,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-12-07 21:07:04,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:04,779 INFO L225 Difference]: With dead ends: 585 [2019-12-07 21:07:04,779 INFO L226 Difference]: Without dead ends: 432 [2019-12-07 21:07:04,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-12-07 21:07:04,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-07 21:07:04,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 289. [2019-12-07 21:07:04,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-12-07 21:07:04,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 521 transitions. [2019-12-07 21:07:04,823 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 521 transitions. Word has length 143 [2019-12-07 21:07:04,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:04,824 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 521 transitions. [2019-12-07 21:07:04,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:07:04,824 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 521 transitions. [2019-12-07 21:07:04,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 21:07:04,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:04,827 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:07:04,827 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:04,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:04,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1977864512, now seen corresponding path program 1 times [2019-12-07 21:07:04,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:04,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71124317] [2019-12-07 21:07:04,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:04,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:07:04,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71124317] [2019-12-07 21:07:04,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:04,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:07:04,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519280684] [2019-12-07 21:07:04,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:07:04,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:04,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:07:04,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:07:04,901 INFO L87 Difference]: Start difference. First operand 289 states and 521 transitions. Second operand 3 states. [2019-12-07 21:07:05,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:05,449 INFO L93 Difference]: Finished difference Result 863 states and 1560 transitions. [2019-12-07 21:07:05,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:07:05,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-12-07 21:07:05,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:05,453 INFO L225 Difference]: With dead ends: 863 [2019-12-07 21:07:05,453 INFO L226 Difference]: Without dead ends: 575 [2019-12-07 21:07:05,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:07:05,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-12-07 21:07:05,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-12-07 21:07:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-07 21:07:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1014 transitions. [2019-12-07 21:07:05,474 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1014 transitions. Word has length 151 [2019-12-07 21:07:05,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:05,475 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1014 transitions. [2019-12-07 21:07:05,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:07:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1014 transitions. [2019-12-07 21:07:05,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 21:07:05,479 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:05,479 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:07:05,479 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:05,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:05,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1458050863, now seen corresponding path program 1 times [2019-12-07 21:07:05,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:05,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432153889] [2019-12-07 21:07:05,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:07:05,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432153889] [2019-12-07 21:07:05,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:05,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:07:05,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190003118] [2019-12-07 21:07:05,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:07:05,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:05,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:07:05,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:07:05,531 INFO L87 Difference]: Start difference. First operand 575 states and 1014 transitions. Second operand 3 states. [2019-12-07 21:07:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:05,841 INFO L93 Difference]: Finished difference Result 1149 states and 2027 transitions. [2019-12-07 21:07:05,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:07:05,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-12-07 21:07:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:05,845 INFO L225 Difference]: With dead ends: 1149 [2019-12-07 21:07:05,845 INFO L226 Difference]: Without dead ends: 575 [2019-12-07 21:07:05,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:07:05,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-12-07 21:07:05,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-12-07 21:07:05,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-07 21:07:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 964 transitions. [2019-12-07 21:07:05,863 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 964 transitions. Word has length 156 [2019-12-07 21:07:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:05,863 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 964 transitions. [2019-12-07 21:07:05,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:07:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 964 transitions. [2019-12-07 21:07:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 21:07:05,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:05,866 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:07:05,866 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:05,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:05,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1273557525, now seen corresponding path program 1 times [2019-12-07 21:07:05,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:05,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143051758] [2019-12-07 21:07:05,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 21:07:05,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143051758] [2019-12-07 21:07:05,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:05,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:07:05,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871419191] [2019-12-07 21:07:05,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:07:05,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:05,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:07:05,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:07:05,922 INFO L87 Difference]: Start difference. First operand 575 states and 964 transitions. Second operand 4 states. [2019-12-07 21:07:06,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:06,783 INFO L93 Difference]: Finished difference Result 2293 states and 3851 transitions. [2019-12-07 21:07:06,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:07:06,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-12-07 21:07:06,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:06,792 INFO L225 Difference]: With dead ends: 2293 [2019-12-07 21:07:06,792 INFO L226 Difference]: Without dead ends: 1719 [2019-12-07 21:07:06,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:07:06,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-12-07 21:07:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1147. [2019-12-07 21:07:06,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-12-07 21:07:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1819 transitions. [2019-12-07 21:07:06,816 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1819 transitions. Word has length 157 [2019-12-07 21:07:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:06,817 INFO L462 AbstractCegarLoop]: Abstraction has 1147 states and 1819 transitions. [2019-12-07 21:07:06,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:07:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1819 transitions. [2019-12-07 21:07:06,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 21:07:06,819 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:06,819 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:07:06,820 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:06,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:06,820 INFO L82 PathProgramCache]: Analyzing trace with hash 559050343, now seen corresponding path program 1 times [2019-12-07 21:07:06,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:06,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398301634] [2019-12-07 21:07:06,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 21:07:06,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398301634] [2019-12-07 21:07:06,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:06,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:07:06,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484325304] [2019-12-07 21:07:06,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:07:06,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:06,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:07:06,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:07:06,870 INFO L87 Difference]: Start difference. First operand 1147 states and 1819 transitions. Second operand 3 states. [2019-12-07 21:07:07,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:07,169 INFO L93 Difference]: Finished difference Result 3439 states and 5455 transitions. [2019-12-07 21:07:07,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:07:07,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-12-07 21:07:07,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:07,178 INFO L225 Difference]: With dead ends: 3439 [2019-12-07 21:07:07,178 INFO L226 Difference]: Without dead ends: 2293 [2019-12-07 21:07:07,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:07:07,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2019-12-07 21:07:07,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2291. [2019-12-07 21:07:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2019-12-07 21:07:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3630 transitions. [2019-12-07 21:07:07,216 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3630 transitions. Word has length 163 [2019-12-07 21:07:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:07,216 INFO L462 AbstractCegarLoop]: Abstraction has 2291 states and 3630 transitions. [2019-12-07 21:07:07,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:07:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3630 transitions. [2019-12-07 21:07:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-12-07 21:07:07,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:07,219 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:07:07,219 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:07,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:07,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1690894427, now seen corresponding path program 1 times [2019-12-07 21:07:07,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:07,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008086436] [2019-12-07 21:07:07,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:07,302 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:07:07,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008086436] [2019-12-07 21:07:07,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:07,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:07:07,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676046649] [2019-12-07 21:07:07,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:07:07,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:07,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:07:07,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:07:07,304 INFO L87 Difference]: Start difference. First operand 2291 states and 3630 transitions. Second operand 5 states. [2019-12-07 21:07:08,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:08,418 INFO L93 Difference]: Finished difference Result 5443 states and 8681 transitions. [2019-12-07 21:07:08,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:07:08,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-12-07 21:07:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:08,434 INFO L225 Difference]: With dead ends: 5443 [2019-12-07 21:07:08,435 INFO L226 Difference]: Without dead ends: 3153 [2019-12-07 21:07:08,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:07:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2019-12-07 21:07:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 2577. [2019-12-07 21:07:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2577 states. [2019-12-07 21:07:08,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2577 states to 2577 states and 4039 transitions. [2019-12-07 21:07:08,482 INFO L78 Accepts]: Start accepts. Automaton has 2577 states and 4039 transitions. Word has length 181 [2019-12-07 21:07:08,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:08,482 INFO L462 AbstractCegarLoop]: Abstraction has 2577 states and 4039 transitions. [2019-12-07 21:07:08,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:07:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2577 states and 4039 transitions. [2019-12-07 21:07:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-12-07 21:07:08,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:08,485 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:07:08,486 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:08,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:08,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1925383678, now seen corresponding path program 1 times [2019-12-07 21:07:08,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:08,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645453671] [2019-12-07 21:07:08,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:07:08,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645453671] [2019-12-07 21:07:08,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:08,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:07:08,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815656693] [2019-12-07 21:07:08,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:07:08,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:08,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:07:08,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:07:08,549 INFO L87 Difference]: Start difference. First operand 2577 states and 4039 transitions. Second operand 3 states. [2019-12-07 21:07:09,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:09,088 INFO L93 Difference]: Finished difference Result 6154 states and 9628 transitions. [2019-12-07 21:07:09,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:07:09,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-12-07 21:07:09,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:09,102 INFO L225 Difference]: With dead ends: 6154 [2019-12-07 21:07:09,102 INFO L226 Difference]: Without dead ends: 3578 [2019-12-07 21:07:09,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:07:09,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2019-12-07 21:07:09,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 3578. [2019-12-07 21:07:09,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3578 states. [2019-12-07 21:07:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3578 states to 3578 states and 5542 transitions. [2019-12-07 21:07:09,155 INFO L78 Accepts]: Start accepts. Automaton has 3578 states and 5542 transitions. Word has length 184 [2019-12-07 21:07:09,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:09,155 INFO L462 AbstractCegarLoop]: Abstraction has 3578 states and 5542 transitions. [2019-12-07 21:07:09,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:07:09,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3578 states and 5542 transitions. [2019-12-07 21:07:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-12-07 21:07:09,159 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:09,160 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:07:09,160 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:09,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:09,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2078776731, now seen corresponding path program 1 times [2019-12-07 21:07:09,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:09,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598422416] [2019-12-07 21:07:09,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:07:09,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598422416] [2019-12-07 21:07:09,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340506779] [2019-12-07 21:07:09,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:07:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:09,418 INFO L264 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 21:07:09,429 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:07:09,486 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 21:07:09,486 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:07:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 21:07:09,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 21:07:09,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-12-07 21:07:09,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317585989] [2019-12-07 21:07:09,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:07:09,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:09,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:07:09,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:07:09,540 INFO L87 Difference]: Start difference. First operand 3578 states and 5542 transitions. Second operand 3 states. [2019-12-07 21:07:10,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:10,169 INFO L93 Difference]: Finished difference Result 10301 states and 15947 transitions. [2019-12-07 21:07:10,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:07:10,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-12-07 21:07:10,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:10,196 INFO L225 Difference]: With dead ends: 10301 [2019-12-07 21:07:10,196 INFO L226 Difference]: Without dead ends: 6724 [2019-12-07 21:07:10,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 379 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:07:10,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6724 states. [2019-12-07 21:07:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6724 to 6724. [2019-12-07 21:07:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6724 states. [2019-12-07 21:07:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6724 states to 6724 states and 10384 transitions. [2019-12-07 21:07:10,306 INFO L78 Accepts]: Start accepts. Automaton has 6724 states and 10384 transitions. Word has length 191 [2019-12-07 21:07:10,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:10,306 INFO L462 AbstractCegarLoop]: Abstraction has 6724 states and 10384 transitions. [2019-12-07 21:07:10,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:07:10,306 INFO L276 IsEmpty]: Start isEmpty. Operand 6724 states and 10384 transitions. [2019-12-07 21:07:10,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-12-07 21:07:10,313 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:10,313 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:07:10,514 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:07:10,514 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:10,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1835490492, now seen corresponding path program 1 times [2019-12-07 21:07:10,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:10,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357789595] [2019-12-07 21:07:10,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-12-07 21:07:10,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357789595] [2019-12-07 21:07:10,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:10,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:07:10,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579822386] [2019-12-07 21:07:10,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:07:10,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:10,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:07:10,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:07:10,581 INFO L87 Difference]: Start difference. First operand 6724 states and 10384 transitions. Second operand 3 states. [2019-12-07 21:07:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:11,194 INFO L93 Difference]: Finished difference Result 18881 states and 29075 transitions. [2019-12-07 21:07:11,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:07:11,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-12-07 21:07:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:11,234 INFO L225 Difference]: With dead ends: 18881 [2019-12-07 21:07:11,235 INFO L226 Difference]: Without dead ends: 12158 [2019-12-07 21:07:11,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:07:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12158 states. [2019-12-07 21:07:11,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12158 to 12158. [2019-12-07 21:07:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12158 states. [2019-12-07 21:07:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12158 states to 12158 states and 17273 transitions. [2019-12-07 21:07:11,433 INFO L78 Accepts]: Start accepts. Automaton has 12158 states and 17273 transitions. Word has length 218 [2019-12-07 21:07:11,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:11,433 INFO L462 AbstractCegarLoop]: Abstraction has 12158 states and 17273 transitions. [2019-12-07 21:07:11,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:07:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 12158 states and 17273 transitions. [2019-12-07 21:07:11,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-12-07 21:07:11,445 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:11,445 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:07:11,445 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:11,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:11,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1785541769, now seen corresponding path program 1 times [2019-12-07 21:07:11,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:11,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017384937] [2019-12-07 21:07:11,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-12-07 21:07:11,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017384937] [2019-12-07 21:07:11,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:11,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:07:11,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869445818] [2019-12-07 21:07:11,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:07:11,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:07:11,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:07:11,499 INFO L87 Difference]: Start difference. First operand 12158 states and 17273 transitions. Second operand 3 states. [2019-12-07 21:07:12,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:12,102 INFO L93 Difference]: Finished difference Result 27032 states and 38579 transitions. [2019-12-07 21:07:12,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:07:12,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-12-07 21:07:12,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:12,127 INFO L225 Difference]: With dead ends: 27032 [2019-12-07 21:07:12,128 INFO L226 Difference]: Without dead ends: 14875 [2019-12-07 21:07:12,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:07:12,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14875 states. [2019-12-07 21:07:12,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14875 to 14875. [2019-12-07 21:07:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14875 states. [2019-12-07 21:07:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14875 states to 14875 states and 19259 transitions. [2019-12-07 21:07:12,270 INFO L78 Accepts]: Start accepts. Automaton has 14875 states and 19259 transitions. Word has length 220 [2019-12-07 21:07:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:12,271 INFO L462 AbstractCegarLoop]: Abstraction has 14875 states and 19259 transitions. [2019-12-07 21:07:12,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:07:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 14875 states and 19259 transitions. [2019-12-07 21:07:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-12-07 21:07:12,281 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:12,281 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:07:12,282 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:12,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:12,282 INFO L82 PathProgramCache]: Analyzing trace with hash 953148522, now seen corresponding path program 1 times [2019-12-07 21:07:12,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:12,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360009808] [2019-12-07 21:07:12,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-12-07 21:07:12,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360009808] [2019-12-07 21:07:12,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:07:12,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:07:12,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367732604] [2019-12-07 21:07:12,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:07:12,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:12,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:07:12,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:07:12,357 INFO L87 Difference]: Start difference. First operand 14875 states and 19259 transitions. Second operand 4 states. [2019-12-07 21:07:13,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:13,290 INFO L93 Difference]: Finished difference Result 39044 states and 50873 transitions. [2019-12-07 21:07:13,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:07:13,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-12-07 21:07:13,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:13,318 INFO L225 Difference]: With dead ends: 39044 [2019-12-07 21:07:13,318 INFO L226 Difference]: Without dead ends: 24170 [2019-12-07 21:07:13,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:07:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24170 states. [2019-12-07 21:07:13,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24170 to 19022. [2019-12-07 21:07:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19022 states. [2019-12-07 21:07:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19022 states to 19022 states and 24110 transitions. [2019-12-07 21:07:13,510 INFO L78 Accepts]: Start accepts. Automaton has 19022 states and 24110 transitions. Word has length 238 [2019-12-07 21:07:13,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:13,511 INFO L462 AbstractCegarLoop]: Abstraction has 19022 states and 24110 transitions. [2019-12-07 21:07:13,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:07:13,511 INFO L276 IsEmpty]: Start isEmpty. Operand 19022 states and 24110 transitions. [2019-12-07 21:07:13,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-12-07 21:07:13,522 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:13,523 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:07:13,523 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:13,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:13,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1519960775, now seen corresponding path program 1 times [2019-12-07 21:07:13,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:13,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770641472] [2019-12-07 21:07:13,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-12-07 21:07:13,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770641472] [2019-12-07 21:07:13,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116762136] [2019-12-07 21:07:13,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:07:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:13,760 INFO L264 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 21:07:13,764 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:07:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 21:07:13,810 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:07:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 21:07:13,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 21:07:13,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-12-07 21:07:13,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882846158] [2019-12-07 21:07:13,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:07:13,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:13,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:07:13,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:07:13,843 INFO L87 Difference]: Start difference. First operand 19022 states and 24110 transitions. Second operand 3 states. [2019-12-07 21:07:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:14,459 INFO L93 Difference]: Finished difference Result 39187 states and 49608 transitions. [2019-12-07 21:07:14,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:07:14,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-12-07 21:07:14,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:14,474 INFO L225 Difference]: With dead ends: 39187 [2019-12-07 21:07:14,474 INFO L226 Difference]: Without dead ends: 20166 [2019-12-07 21:07:14,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 486 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:07:14,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20166 states. [2019-12-07 21:07:14,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20166 to 19737. [2019-12-07 21:07:14,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19737 states. [2019-12-07 21:07:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19737 states to 19737 states and 24240 transitions. [2019-12-07 21:07:14,707 INFO L78 Accepts]: Start accepts. Automaton has 19737 states and 24240 transitions. Word has length 244 [2019-12-07 21:07:14,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:14,707 INFO L462 AbstractCegarLoop]: Abstraction has 19737 states and 24240 transitions. [2019-12-07 21:07:14,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:07:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 19737 states and 24240 transitions. [2019-12-07 21:07:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-12-07 21:07:14,719 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:14,719 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:07:14,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:07:14,921 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:14,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:14,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1251631914, now seen corresponding path program 1 times [2019-12-07 21:07:14,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:14,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816331249] [2019-12-07 21:07:14,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 142 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-12-07 21:07:15,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816331249] [2019-12-07 21:07:15,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550360919] [2019-12-07 21:07:15,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:07:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:15,159 INFO L264 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 21:07:15,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:07:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 21:07:15,207 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:07:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 21:07:15,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 21:07:15,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 4 [2019-12-07 21:07:15,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60860458] [2019-12-07 21:07:15,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:07:15,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:15,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:07:15,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:07:15,252 INFO L87 Difference]: Start difference. First operand 19737 states and 24240 transitions. Second operand 3 states. [2019-12-07 21:07:15,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:15,822 INFO L93 Difference]: Finished difference Result 43906 states and 54083 transitions. [2019-12-07 21:07:15,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:07:15,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2019-12-07 21:07:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:15,838 INFO L225 Difference]: With dead ends: 43906 [2019-12-07 21:07:15,839 INFO L226 Difference]: Without dead ends: 24170 [2019-12-07 21:07:15,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 543 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:07:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24170 states. [2019-12-07 21:07:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24170 to 24170. [2019-12-07 21:07:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24170 states. [2019-12-07 21:07:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24170 states to 24170 states and 28886 transitions. [2019-12-07 21:07:16,103 INFO L78 Accepts]: Start accepts. Automaton has 24170 states and 28886 transitions. Word has length 273 [2019-12-07 21:07:16,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:16,104 INFO L462 AbstractCegarLoop]: Abstraction has 24170 states and 28886 transitions. [2019-12-07 21:07:16,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:07:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 24170 states and 28886 transitions. [2019-12-07 21:07:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-12-07 21:07:16,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:07:16,115 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:07:16,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:07:16,316 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:07:16,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:07:16,317 INFO L82 PathProgramCache]: Analyzing trace with hash 135941822, now seen corresponding path program 1 times [2019-12-07 21:07:16,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:07:16,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539001450] [2019-12-07 21:07:16,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:07:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 130 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 21:07:16,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539001450] [2019-12-07 21:07:16,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037875509] [2019-12-07 21:07:16,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:07:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:07:16,623 INFO L264 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 21:07:16,627 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:07:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 21:07:16,796 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:07:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 21:07:16,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 21:07:16,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 6 [2019-12-07 21:07:16,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009942307] [2019-12-07 21:07:16,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:07:16,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:07:16,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:07:16,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:07:16,879 INFO L87 Difference]: Start difference. First operand 24170 states and 28886 transitions. Second operand 4 states. [2019-12-07 21:07:17,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:07:17,757 INFO L93 Difference]: Finished difference Result 56488 states and 67108 transitions. [2019-12-07 21:07:17,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:07:17,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 274 [2019-12-07 21:07:17,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:07:17,758 INFO L225 Difference]: With dead ends: 56488 [2019-12-07 21:07:17,758 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 21:07:17,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 545 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:07:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 21:07:17,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 21:07:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 21:07:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 21:07:17,773 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 274 [2019-12-07 21:07:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:07:17,773 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 21:07:17,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:07:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 21:07:17,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 21:07:17,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:07:17,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 21:07:18,330 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 159 [2019-12-07 21:07:18,553 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 159 [2019-12-07 21:07:18,862 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 37 [2019-12-07 21:07:19,180 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 37 [2019-12-07 21:07:19,182 INFO L246 CegarLoopResult]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,182 INFO L246 CegarLoopResult]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,182 INFO L246 CegarLoopResult]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,182 INFO L246 CegarLoopResult]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,182 INFO L246 CegarLoopResult]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,182 INFO L246 CegarLoopResult]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,182 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,183 INFO L246 CegarLoopResult]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,183 INFO L246 CegarLoopResult]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,183 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,183 INFO L246 CegarLoopResult]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,183 INFO L246 CegarLoopResult]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,183 INFO L246 CegarLoopResult]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,183 INFO L246 CegarLoopResult]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,183 INFO L246 CegarLoopResult]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,183 INFO L246 CegarLoopResult]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,183 INFO L246 CegarLoopResult]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,183 INFO L246 CegarLoopResult]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,183 INFO L246 CegarLoopResult]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,183 INFO L246 CegarLoopResult]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,183 INFO L246 CegarLoopResult]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,183 INFO L246 CegarLoopResult]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,183 INFO L246 CegarLoopResult]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,184 INFO L246 CegarLoopResult]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,184 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,184 INFO L246 CegarLoopResult]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,184 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,184 INFO L246 CegarLoopResult]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,184 INFO L246 CegarLoopResult]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,184 INFO L246 CegarLoopResult]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,184 INFO L246 CegarLoopResult]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,184 INFO L246 CegarLoopResult]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,184 INFO L246 CegarLoopResult]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,184 INFO L246 CegarLoopResult]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,184 INFO L246 CegarLoopResult]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,184 INFO L246 CegarLoopResult]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,184 INFO L246 CegarLoopResult]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,184 INFO L246 CegarLoopResult]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,184 INFO L246 CegarLoopResult]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,185 INFO L246 CegarLoopResult]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,185 INFO L246 CegarLoopResult]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,185 INFO L246 CegarLoopResult]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,185 INFO L246 CegarLoopResult]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,185 INFO L246 CegarLoopResult]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,185 INFO L246 CegarLoopResult]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,185 INFO L246 CegarLoopResult]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,185 INFO L246 CegarLoopResult]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 21:07:19,185 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,185 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 21:07:19,185 INFO L246 CegarLoopResult]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,185 INFO L246 CegarLoopResult]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,185 INFO L246 CegarLoopResult]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,185 INFO L246 CegarLoopResult]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,185 INFO L246 CegarLoopResult]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,185 INFO L246 CegarLoopResult]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,186 INFO L246 CegarLoopResult]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,186 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,186 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,186 INFO L246 CegarLoopResult]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,186 INFO L246 CegarLoopResult]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,186 INFO L246 CegarLoopResult]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-12-07 21:07:19,186 INFO L246 CegarLoopResult]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-12-07 21:07:19,186 INFO L246 CegarLoopResult]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,186 INFO L246 CegarLoopResult]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,186 INFO L246 CegarLoopResult]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,186 INFO L242 CegarLoopResult]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse2 (= ~a11~0 1)) (.cse3 (= ~a27~0 1)) (.cse5 (= ~a26~0 1))) (let ((.cse1 (or .cse3 .cse5)) (.cse4 (not .cse2)) (.cse0 (= 1 ~a5~0))) (or (and (<= 1 ~a3~0) .cse0) (and .cse1 .cse0 (not (= ~a12~0 1))) (and .cse1 .cse0 .cse2) (and .cse1 .cse0 (<= ~a11~0 0)) (and .cse3 .cse0) (and .cse0 .cse4 (not (= 1 ~a6~0))) (and .cse0 .cse4 (= ~a16~0 1)) (and (= ~a27~0 0) .cse0 .cse5)))) [2019-12-07 21:07:19,186 INFO L246 CegarLoopResult]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,187 INFO L246 CegarLoopResult]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,187 INFO L246 CegarLoopResult]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,187 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1647) no Hoare annotation was computed. [2019-12-07 21:07:19,187 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,187 INFO L249 CegarLoopResult]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-12-07 21:07:19,187 INFO L246 CegarLoopResult]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,187 INFO L246 CegarLoopResult]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,187 INFO L246 CegarLoopResult]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,187 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,187 INFO L246 CegarLoopResult]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,187 INFO L246 CegarLoopResult]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,187 INFO L246 CegarLoopResult]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,187 INFO L246 CegarLoopResult]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,187 INFO L246 CegarLoopResult]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,187 INFO L246 CegarLoopResult]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,188 INFO L246 CegarLoopResult]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,188 INFO L246 CegarLoopResult]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,188 INFO L246 CegarLoopResult]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,188 INFO L246 CegarLoopResult]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,188 INFO L242 CegarLoopResult]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse2 (= ~a11~0 1)) (.cse3 (= ~a27~0 1)) (.cse5 (= ~a26~0 1))) (let ((.cse1 (or .cse3 .cse5)) (.cse4 (not .cse2)) (.cse0 (= 1 ~a5~0))) (or (and (<= 1 ~a3~0) .cse0) (and .cse1 .cse0 (not (= ~a12~0 1))) (and .cse1 .cse0 .cse2) (and .cse1 .cse0 (<= ~a11~0 0)) (and .cse3 .cse0) (and .cse0 .cse4 (not (= 1 ~a6~0))) (and .cse0 .cse4 (= ~a16~0 1)) (and (= ~a27~0 0) .cse0 .cse5)))) [2019-12-07 21:07:19,188 INFO L246 CegarLoopResult]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,188 INFO L246 CegarLoopResult]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,188 INFO L246 CegarLoopResult]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,188 INFO L246 CegarLoopResult]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,188 INFO L246 CegarLoopResult]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,188 INFO L246 CegarLoopResult]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,188 INFO L246 CegarLoopResult]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,188 INFO L246 CegarLoopResult]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,188 INFO L246 CegarLoopResult]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,189 INFO L246 CegarLoopResult]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,189 INFO L246 CegarLoopResult]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,189 INFO L246 CegarLoopResult]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-12-07 21:07:19,189 INFO L246 CegarLoopResult]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,189 INFO L246 CegarLoopResult]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,189 INFO L246 CegarLoopResult]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,189 INFO L246 CegarLoopResult]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,189 INFO L246 CegarLoopResult]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,189 INFO L246 CegarLoopResult]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,189 INFO L246 CegarLoopResult]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,189 INFO L246 CegarLoopResult]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,189 INFO L246 CegarLoopResult]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,189 INFO L246 CegarLoopResult]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,189 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,189 INFO L246 CegarLoopResult]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,189 INFO L246 CegarLoopResult]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,190 INFO L246 CegarLoopResult]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,190 INFO L246 CegarLoopResult]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,190 INFO L246 CegarLoopResult]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,190 INFO L246 CegarLoopResult]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,190 INFO L246 CegarLoopResult]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,190 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 21:07:19,190 INFO L246 CegarLoopResult]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,190 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,190 INFO L246 CegarLoopResult]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,190 INFO L246 CegarLoopResult]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,190 INFO L246 CegarLoopResult]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,190 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,190 INFO L246 CegarLoopResult]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,190 INFO L246 CegarLoopResult]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,190 INFO L246 CegarLoopResult]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,190 INFO L246 CegarLoopResult]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,191 INFO L246 CegarLoopResult]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,191 INFO L246 CegarLoopResult]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,191 INFO L246 CegarLoopResult]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,191 INFO L246 CegarLoopResult]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,191 INFO L246 CegarLoopResult]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,191 INFO L246 CegarLoopResult]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,191 INFO L246 CegarLoopResult]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,191 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,191 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,191 INFO L246 CegarLoopResult]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,191 INFO L246 CegarLoopResult]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,191 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,191 INFO L246 CegarLoopResult]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,191 INFO L246 CegarLoopResult]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,191 INFO L246 CegarLoopResult]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,191 INFO L246 CegarLoopResult]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,191 INFO L246 CegarLoopResult]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,192 INFO L246 CegarLoopResult]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,192 INFO L246 CegarLoopResult]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,192 INFO L246 CegarLoopResult]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-12-07 21:07:19,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:07:19 BoogieIcfgContainer [2019-12-07 21:07:19,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:07:19,207 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:07:19,207 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:07:19,207 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:07:19,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:07:03" (3/4) ... [2019-12-07 21:07:19,210 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 21:07:19,234 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 115 nodes and edges [2019-12-07 21:07:19,238 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-12-07 21:07:19,242 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-12-07 21:07:19,245 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 21:07:19,369 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_575389fc-24ea-41e2-9e55-9da79aed5ac0/bin/utaipan/witness.graphml [2019-12-07 21:07:19,369 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:07:19,370 INFO L168 Benchmark]: Toolchain (without parser) took 18874.19 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 930.6 MB). Free memory was 934.4 MB in the beginning and 1.3 GB in the end (delta: -364.7 MB). Peak memory consumption was 565.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:07:19,370 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:07:19,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 629.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 934.4 MB in the beginning and 1.0 GB in the end (delta: -105.2 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-12-07 21:07:19,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:07:19,371 INFO L168 Benchmark]: Boogie Preprocessor took 63.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:07:19,371 INFO L168 Benchmark]: RCFGBuilder took 1767.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 822.6 MB in the end (delta: 190.0 MB). Peak memory consumption was 195.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:07:19,372 INFO L168 Benchmark]: TraceAbstraction took 16167.63 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 824.2 MB). Free memory was 822.6 MB in the beginning and 1.4 GB in the end (delta: -542.7 MB). Peak memory consumption was 918.0 MB. Max. memory is 11.5 GB. [2019-12-07 21:07:19,372 INFO L168 Benchmark]: Witness Printer took 162.13 ms. Allocated memory is still 2.0 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 66.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:07:19,373 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 629.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 934.4 MB in the beginning and 1.0 GB in the end (delta: -105.2 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1767.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 822.6 MB in the end (delta: 190.0 MB). Peak memory consumption was 195.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16167.63 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 824.2 MB). Free memory was 822.6 MB in the beginning and 1.4 GB in the end (delta: -542.7 MB). Peak memory consumption was 918.0 MB. Max. memory is 11.5 GB. * Witness Printer took 162.13 ms. Allocated memory is still 2.0 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 66.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1647]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: (((((((1 <= a3 && 1 == a5) || (((a27 == 1 || a26 == 1) && 1 == a5) && !(a12 == 1))) || (((a27 == 1 || a26 == 1) && 1 == a5) && a11 == 1)) || (((a27 == 1 || a26 == 1) && 1 == a5) && a11 <= 0)) || (a27 == 1 && 1 == a5)) || ((1 == a5 && !(a11 == 1)) && !(1 == a6))) || ((1 == a5 && !(a11 == 1)) && a16 == 1)) || ((a27 == 0 && 1 == a5) && a26 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((1 <= a3 && 1 == a5) || (((a27 == 1 || a26 == 1) && 1 == a5) && !(a12 == 1))) || (((a27 == 1 || a26 == 1) && 1 == a5) && a11 == 1)) || (((a27 == 1 || a26 == 1) && 1 == a5) && a11 <= 0)) || (a27 == 1 && 1 == a5)) || ((1 == a5 && !(a11 == 1)) && !(1 == a6))) || ((1 == a5 && !(a11 == 1)) && a16 == 1)) || ((a27 == 0 && 1 == a5) && a26 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: SAFE, OverallTime: 14.8s, OverallIterations: 14, TraceHistogramMax: 5, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 1441 SDtfs, 2674 SDslu, 388 SDs, 0 SdLazy, 7873 SolverSat, 1876 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2004 GetRequests, 1965 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24170occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 6870 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 438 NumberOfFragments, 183 HoareAnnotationTreeSize, 3 FomulaSimplifications, 20054 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 5942 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 3775 NumberOfCodeBlocks, 3775 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4735 ConstructedInterpolants, 0 QuantifiedInterpolants, 2737099 SizeOfPredicates, 23 NumberOfNonLiveVariables, 2014 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 22 InterpolantComputations, 18 PerfectInterpolantSequences, 2181/2194 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...