./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label39.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_8dbd618d-caa6-43f8-9b0e-c7b134efae33/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label39.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/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 1e89048ccdb20a97a14cb213e125edb5cbe6d123 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 16:44:35,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:44:35,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:44:35,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:44:35,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:44:35,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:44:35,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:44:35,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:44:35,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:44:35,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:44:35,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:44:35,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:44:35,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:44:35,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:44:35,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:44:35,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:44:35,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:44:35,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:44:35,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:44:35,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:44:35,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:44:35,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:44:35,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:44:35,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:44:35,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:44:35,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:44:35,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:44:35,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:44:35,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:44:35,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:44:35,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:44:35,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:44:35,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:44:35,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:44:35,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:44:35,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:44:35,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:44:35,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:44:35,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:44:35,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:44:35,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:44:35,521 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:44:35,531 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:44:35,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:44:35,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:44:35,532 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:44:35,532 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:44:35,532 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:44:35,533 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:44:35,533 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:44:35,533 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:44:35,533 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:44:35,533 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:44:35,533 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:44:35,533 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:44:35,533 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:44:35,534 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:44:35,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:44:35,534 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:44:35,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:44:35,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:44:35,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:44:35,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:44:35,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:44:35,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:44:35,535 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:44:35,535 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:44:35,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:44:35,535 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:44:35,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:44:35,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:44:35,536 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:44:35,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:44:35,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:44:35,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:44:35,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:44:35,536 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:44:35,536 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:44:35,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:44:35,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:44:35,537 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:44:35,537 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:44:35,537 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_8dbd618d-caa6-43f8-9b0e-c7b134efae33/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 -> 1e89048ccdb20a97a14cb213e125edb5cbe6d123 [2019-12-07 16:44:35,637 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:44:35,648 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:44:35,651 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:44:35,652 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:44:35,652 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:44:35,653 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label39.c [2019-12-07 16:44:35,694 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/bin/utaipan/data/e8c27e169/cb4750fccff040838da4a369aaa8c77f/FLAG0da8b9017 [2019-12-07 16:44:36,184 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:44:36,184 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/sv-benchmarks/c/eca-rers2012/Problem02_label39.c [2019-12-07 16:44:36,194 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/bin/utaipan/data/e8c27e169/cb4750fccff040838da4a369aaa8c77f/FLAG0da8b9017 [2019-12-07 16:44:36,203 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/bin/utaipan/data/e8c27e169/cb4750fccff040838da4a369aaa8c77f [2019-12-07 16:44:36,205 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:44:36,206 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:44:36,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:44:36,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:44:36,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:44:36,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:44:36" (1/1) ... [2019-12-07 16:44:36,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aaa2f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:44:36, skipping insertion in model container [2019-12-07 16:44:36,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:44:36" (1/1) ... [2019-12-07 16:44:36,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:44:36,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:44:36,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:44:36,518 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:44:36,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:44:36,583 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:44:36,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:44:36 WrapperNode [2019-12-07 16:44:36,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:44:36,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:44:36,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:44:36,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:44:36,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:44:36" (1/1) ... [2019-12-07 16:44:36,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:44:36" (1/1) ... [2019-12-07 16:44:36,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:44:36,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:44:36,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:44:36,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:44:36,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:44:36" (1/1) ... [2019-12-07 16:44:36,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:44:36" (1/1) ... [2019-12-07 16:44:36,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:44:36" (1/1) ... [2019-12-07 16:44:36,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:44:36" (1/1) ... [2019-12-07 16:44:36,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:44:36" (1/1) ... [2019-12-07 16:44:36,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:44:36" (1/1) ... [2019-12-07 16:44:36,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:44:36" (1/1) ... [2019-12-07 16:44:36,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:44:36,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:44:36,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:44:36,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:44:36,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:44:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/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 16:44:36,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:44:36,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:44:37,809 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:44:37,810 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 16:44:37,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:44:37 BoogieIcfgContainer [2019-12-07 16:44:37,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:44:37,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:44:37,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:44:37,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:44:37,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:44:36" (1/3) ... [2019-12-07 16:44:37,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677f8e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:44:37, skipping insertion in model container [2019-12-07 16:44:37,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:44:36" (2/3) ... [2019-12-07 16:44:37,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677f8e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:44:37, skipping insertion in model container [2019-12-07 16:44:37,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:44:37" (3/3) ... [2019-12-07 16:44:37,817 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label39.c [2019-12-07 16:44:37,824 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:44:37,829 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:44:37,841 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:44:37,858 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:44:37,858 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:44:37,859 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:44:37,859 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:44:37,859 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:44:37,859 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:44:37,859 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:44:37,859 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:44:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-12-07 16:44:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 16:44:37,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:37,881 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] [2019-12-07 16:44:37,882 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:44:37,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:37,887 INFO L82 PathProgramCache]: Analyzing trace with hash 925950345, now seen corresponding path program 1 times [2019-12-07 16:44:37,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:44:37,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174177052] [2019-12-07 16:44:37,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:38,149 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 16:44:38,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174177052] [2019-12-07 16:44:38,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:44:38,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:44:38,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636596246] [2019-12-07 16:44:38,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:44:38,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:44:38,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:44:38,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:44:38,166 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-12-07 16:44:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:38,588 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-12-07 16:44:38,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:44:38,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-07 16:44:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:38,600 INFO L225 Difference]: With dead ends: 333 [2019-12-07 16:44:38,600 INFO L226 Difference]: Without dead ends: 243 [2019-12-07 16:44:38,602 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 16:44:38,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-12-07 16:44:38,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 163. [2019-12-07 16:44:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 16:44:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 298 transitions. [2019-12-07 16:44:38,637 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 298 transitions. Word has length 80 [2019-12-07 16:44:38,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:38,638 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 298 transitions. [2019-12-07 16:44:38,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:44:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 298 transitions. [2019-12-07 16:44:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 16:44:38,641 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:38,641 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:44:38,641 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:44:38,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:38,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1028671102, now seen corresponding path program 1 times [2019-12-07 16:44:38,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:44:38,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640996664] [2019-12-07 16:44:38,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:38,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640996664] [2019-12-07 16:44:38,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:44:38,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:44:38,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112331942] [2019-12-07 16:44:38,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:44:38,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:44:38,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:44:38,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:44:38,725 INFO L87 Difference]: Start difference. First operand 163 states and 298 transitions. Second operand 4 states. [2019-12-07 16:44:39,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:39,121 INFO L93 Difference]: Finished difference Result 645 states and 1187 transitions. [2019-12-07 16:44:39,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:44:39,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-07 16:44:39,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:39,125 INFO L225 Difference]: With dead ends: 645 [2019-12-07 16:44:39,125 INFO L226 Difference]: Without dead ends: 483 [2019-12-07 16:44:39,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 16:44:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-12-07 16:44:39,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-12-07 16:44:39,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-12-07 16:44:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 788 transitions. [2019-12-07 16:44:39,147 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 788 transitions. Word has length 84 [2019-12-07 16:44:39,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:39,147 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 788 transitions. [2019-12-07 16:44:39,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:44:39,148 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 788 transitions. [2019-12-07 16:44:39,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 16:44:39,151 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:39,151 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 16:44:39,151 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:44:39,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:39,151 INFO L82 PathProgramCache]: Analyzing trace with hash -792073672, now seen corresponding path program 1 times [2019-12-07 16:44:39,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:44:39,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193399837] [2019-12-07 16:44:39,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 16:44:39,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193399837] [2019-12-07 16:44:39,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:44:39,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:44:39,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519965197] [2019-12-07 16:44:39,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:44:39,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:44:39,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:44:39,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:44:39,182 INFO L87 Difference]: Start difference. First operand 483 states and 788 transitions. Second operand 3 states. [2019-12-07 16:44:39,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:39,393 INFO L93 Difference]: Finished difference Result 1365 states and 2221 transitions. [2019-12-07 16:44:39,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:44:39,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-12-07 16:44:39,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:39,398 INFO L225 Difference]: With dead ends: 1365 [2019-12-07 16:44:39,398 INFO L226 Difference]: Without dead ends: 883 [2019-12-07 16:44:39,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 16:44:39,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-12-07 16:44:39,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 563. [2019-12-07 16:44:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-12-07 16:44:39,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 929 transitions. [2019-12-07 16:44:39,416 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 929 transitions. Word has length 90 [2019-12-07 16:44:39,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:39,416 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 929 transitions. [2019-12-07 16:44:39,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:44:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 929 transitions. [2019-12-07 16:44:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 16:44:39,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:39,418 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:44:39,418 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:44:39,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:39,419 INFO L82 PathProgramCache]: Analyzing trace with hash -833109491, now seen corresponding path program 1 times [2019-12-07 16:44:39,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:44:39,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132234492] [2019-12-07 16:44:39,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:39,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132234492] [2019-12-07 16:44:39,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:44:39,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:44:39,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687220739] [2019-12-07 16:44:39,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:44:39,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:44:39,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:44:39,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:44:39,445 INFO L87 Difference]: Start difference. First operand 563 states and 929 transitions. Second operand 3 states. [2019-12-07 16:44:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:39,680 INFO L93 Difference]: Finished difference Result 1445 states and 2382 transitions. [2019-12-07 16:44:39,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:44:39,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-12-07 16:44:39,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:39,686 INFO L225 Difference]: With dead ends: 1445 [2019-12-07 16:44:39,686 INFO L226 Difference]: Without dead ends: 883 [2019-12-07 16:44:39,687 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 16:44:39,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-12-07 16:44:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2019-12-07 16:44:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-12-07 16:44:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1344 transitions. [2019-12-07 16:44:39,711 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1344 transitions. Word has length 90 [2019-12-07 16:44:39,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:39,711 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1344 transitions. [2019-12-07 16:44:39,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:44:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1344 transitions. [2019-12-07 16:44:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 16:44:39,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:39,714 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-12-07 16:44:39,714 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:44:39,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:39,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1750164066, now seen corresponding path program 1 times [2019-12-07 16:44:39,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:44:39,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974289785] [2019-12-07 16:44:39,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:39,757 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 16:44:39,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974289785] [2019-12-07 16:44:39,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:44:39,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:44:39,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170414419] [2019-12-07 16:44:39,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:44:39,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:44:39,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:44:39,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:44:39,759 INFO L87 Difference]: Start difference. First operand 883 states and 1344 transitions. Second operand 4 states. [2019-12-07 16:44:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:40,126 INFO L93 Difference]: Finished difference Result 2805 states and 4224 transitions. [2019-12-07 16:44:40,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:44:40,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-12-07 16:44:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:40,134 INFO L225 Difference]: With dead ends: 2805 [2019-12-07 16:44:40,134 INFO L226 Difference]: Without dead ends: 1923 [2019-12-07 16:44:40,136 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 16:44:40,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2019-12-07 16:44:40,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1203. [2019-12-07 16:44:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-12-07 16:44:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1769 transitions. [2019-12-07 16:44:40,165 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1769 transitions. Word has length 104 [2019-12-07 16:44:40,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:40,165 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1769 transitions. [2019-12-07 16:44:40,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:44:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1769 transitions. [2019-12-07 16:44:40,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 16:44:40,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:40,167 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:44:40,168 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:44:40,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:40,168 INFO L82 PathProgramCache]: Analyzing trace with hash -279026646, now seen corresponding path program 1 times [2019-12-07 16:44:40,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:44:40,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546575096] [2019-12-07 16:44:40,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:40,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546575096] [2019-12-07 16:44:40,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:44:40,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:44:40,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787096186] [2019-12-07 16:44:40,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:44:40,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:44:40,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:44:40,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:44:40,223 INFO L87 Difference]: Start difference. First operand 1203 states and 1769 transitions. Second operand 4 states. [2019-12-07 16:44:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:40,626 INFO L93 Difference]: Finished difference Result 2725 states and 3982 transitions. [2019-12-07 16:44:40,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:44:40,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-12-07 16:44:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:40,634 INFO L225 Difference]: With dead ends: 2725 [2019-12-07 16:44:40,635 INFO L226 Difference]: Without dead ends: 1523 [2019-12-07 16:44:40,636 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 16:44:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2019-12-07 16:44:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1363. [2019-12-07 16:44:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-12-07 16:44:40,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1774 transitions. [2019-12-07 16:44:40,670 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1774 transitions. Word has length 111 [2019-12-07 16:44:40,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:40,670 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1774 transitions. [2019-12-07 16:44:40,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:44:40,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1774 transitions. [2019-12-07 16:44:40,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 16:44:40,673 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:40,673 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-12-07 16:44:40,673 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:44:40,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:40,674 INFO L82 PathProgramCache]: Analyzing trace with hash -130998907, now seen corresponding path program 1 times [2019-12-07 16:44:40,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:44:40,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393025447] [2019-12-07 16:44:40,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:40,730 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 16:44:40,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393025447] [2019-12-07 16:44:40,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:44:40,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:44:40,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693240812] [2019-12-07 16:44:40,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:44:40,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:44:40,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:44:40,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:44:40,731 INFO L87 Difference]: Start difference. First operand 1363 states and 1774 transitions. Second operand 4 states. [2019-12-07 16:44:41,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:41,144 INFO L93 Difference]: Finished difference Result 3205 states and 4207 transitions. [2019-12-07 16:44:41,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:44:41,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-12-07 16:44:41,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:41,153 INFO L225 Difference]: With dead ends: 3205 [2019-12-07 16:44:41,153 INFO L226 Difference]: Without dead ends: 1843 [2019-12-07 16:44:41,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 16:44:41,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2019-12-07 16:44:41,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1203. [2019-12-07 16:44:41,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-12-07 16:44:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1494 transitions. [2019-12-07 16:44:41,185 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1494 transitions. Word has length 113 [2019-12-07 16:44:41,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:41,186 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1494 transitions. [2019-12-07 16:44:41,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:44:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1494 transitions. [2019-12-07 16:44:41,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 16:44:41,188 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:41,189 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:44:41,189 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:44:41,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:41,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1177512871, now seen corresponding path program 1 times [2019-12-07 16:44:41,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:44:41,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106430825] [2019-12-07 16:44:41,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:41,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106430825] [2019-12-07 16:44:41,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:44:41,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:44:41,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94887155] [2019-12-07 16:44:41,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:44:41,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:44:41,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:44:41,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:44:41,231 INFO L87 Difference]: Start difference. First operand 1203 states and 1494 transitions. Second operand 3 states. [2019-12-07 16:44:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:41,448 INFO L93 Difference]: Finished difference Result 2725 states and 3337 transitions. [2019-12-07 16:44:41,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:44:41,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-12-07 16:44:41,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:41,454 INFO L225 Difference]: With dead ends: 2725 [2019-12-07 16:44:41,454 INFO L226 Difference]: Without dead ends: 1443 [2019-12-07 16:44:41,455 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 16:44:41,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2019-12-07 16:44:41,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1363. [2019-12-07 16:44:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-12-07 16:44:41,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1612 transitions. [2019-12-07 16:44:41,475 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1612 transitions. Word has length 120 [2019-12-07 16:44:41,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:41,475 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1612 transitions. [2019-12-07 16:44:41,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:44:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1612 transitions. [2019-12-07 16:44:41,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-12-07 16:44:41,477 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:41,477 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 16:44:41,477 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:44:41,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:41,478 INFO L82 PathProgramCache]: Analyzing trace with hash 178145204, now seen corresponding path program 1 times [2019-12-07 16:44:41,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:44:41,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364061330] [2019-12-07 16:44:41,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 16:44:41,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364061330] [2019-12-07 16:44:41,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:44:41,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:44:41,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988492000] [2019-12-07 16:44:41,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:44:41,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:44:41,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:44:41,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:44:41,510 INFO L87 Difference]: Start difference. First operand 1363 states and 1612 transitions. Second operand 3 states. [2019-12-07 16:44:41,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:41,713 INFO L93 Difference]: Finished difference Result 3045 states and 3576 transitions. [2019-12-07 16:44:41,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:44:41,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-12-07 16:44:41,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:41,718 INFO L225 Difference]: With dead ends: 3045 [2019-12-07 16:44:41,718 INFO L226 Difference]: Without dead ends: 1203 [2019-12-07 16:44:41,720 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 16:44:41,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-12-07 16:44:41,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1123. [2019-12-07 16:44:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-12-07 16:44:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1260 transitions. [2019-12-07 16:44:41,744 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1260 transitions. Word has length 129 [2019-12-07 16:44:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:41,744 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1260 transitions. [2019-12-07 16:44:41,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:44:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1260 transitions. [2019-12-07 16:44:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 16:44:41,747 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:41,748 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 16:44:41,748 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:44:41,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:41,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1469786071, now seen corresponding path program 1 times [2019-12-07 16:44:41,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:44:41,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585404076] [2019-12-07 16:44:41,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:41,852 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 16:44:41,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585404076] [2019-12-07 16:44:41,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367476912] [2019-12-07 16:44:41,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/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 16:44:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:41,912 INFO L264 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:44:41,918 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 16:44:41,953 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:44:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 16:44:41,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:44:41,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-12-07 16:44:41,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266112993] [2019-12-07 16:44:41,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:44:41,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:44:41,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:44:41,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:44:41,975 INFO L87 Difference]: Start difference. First operand 1123 states and 1260 transitions. Second operand 3 states. [2019-12-07 16:44:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:42,158 INFO L93 Difference]: Finished difference Result 2165 states and 2412 transitions. [2019-12-07 16:44:42,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:44:42,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-12-07 16:44:42,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:42,163 INFO L225 Difference]: With dead ends: 2165 [2019-12-07 16:44:42,163 INFO L226 Difference]: Without dead ends: 883 [2019-12-07 16:44:42,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:44:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-12-07 16:44:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2019-12-07 16:44:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-12-07 16:44:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 965 transitions. [2019-12-07 16:44:42,184 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 965 transitions. Word has length 143 [2019-12-07 16:44:42,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:42,184 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 965 transitions. [2019-12-07 16:44:42,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:44:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 965 transitions. [2019-12-07 16:44:42,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-12-07 16:44:42,187 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:42,187 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-12-07 16:44:42,387 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:42,388 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:44:42,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:42,388 INFO L82 PathProgramCache]: Analyzing trace with hash -871464942, now seen corresponding path program 1 times [2019-12-07 16:44:42,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:44:42,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102769164] [2019-12-07 16:44:42,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:42,520 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-12-07 16:44:42,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102769164] [2019-12-07 16:44:42,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818515994] [2019-12-07 16:44:42,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/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 16:44:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:42,585 INFO L264 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 16:44:42,590 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:42,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-12-07 16:44:42,635 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:44:42,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 16:44:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-12-07 16:44:42,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:44:42,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 6 [2019-12-07 16:44:42,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655634790] [2019-12-07 16:44:42,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:44:42,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:44:42,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:44:42,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:44:42,679 INFO L87 Difference]: Start difference. First operand 883 states and 965 transitions. Second operand 5 states. [2019-12-07 16:44:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:43,018 INFO L93 Difference]: Finished difference Result 1706 states and 1865 transitions. [2019-12-07 16:44:43,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:44:43,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2019-12-07 16:44:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:43,023 INFO L225 Difference]: With dead ends: 1706 [2019-12-07 16:44:43,023 INFO L226 Difference]: Without dead ends: 904 [2019-12-07 16:44:43,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 335 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:44:43,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2019-12-07 16:44:43,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 883. [2019-12-07 16:44:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-12-07 16:44:43,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 952 transitions. [2019-12-07 16:44:43,040 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 952 transitions. Word has length 169 [2019-12-07 16:44:43,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:43,040 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 952 transitions. [2019-12-07 16:44:43,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:44:43,040 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 952 transitions. [2019-12-07 16:44:43,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-12-07 16:44:43,043 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:43,044 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-12-07 16:44:43,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:43,244 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:44:43,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:43,245 INFO L82 PathProgramCache]: Analyzing trace with hash -904064826, now seen corresponding path program 1 times [2019-12-07 16:44:43,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:44:43,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417192747] [2019-12-07 16:44:43,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 177 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-12-07 16:44:43,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417192747] [2019-12-07 16:44:43,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801769811] [2019-12-07 16:44:43,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/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 16:44:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:43,477 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:44:43,481 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:43,524 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-12-07 16:44:43,525 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:44:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-12-07 16:44:43,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:44:43,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 10 [2019-12-07 16:44:43,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861449428] [2019-12-07 16:44:43,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:44:43,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:44:43,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:44:43,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:44:43,559 INFO L87 Difference]: Start difference. First operand 883 states and 952 transitions. Second operand 4 states. [2019-12-07 16:44:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:43,801 INFO L93 Difference]: Finished difference Result 1765 states and 1911 transitions. [2019-12-07 16:44:43,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:44:43,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-12-07 16:44:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:43,804 INFO L225 Difference]: With dead ends: 1765 [2019-12-07 16:44:43,804 INFO L226 Difference]: Without dead ends: 643 [2019-12-07 16:44:43,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:44:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-12-07 16:44:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-12-07 16:44:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-12-07 16:44:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 667 transitions. [2019-12-07 16:44:43,813 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 667 transitions. Word has length 202 [2019-12-07 16:44:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:43,813 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 667 transitions. [2019-12-07 16:44:43,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:44:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 667 transitions. [2019-12-07 16:44:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-12-07 16:44:43,815 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:43,815 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 16:44:44,015 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:44,015 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:44:44,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:44,016 INFO L82 PathProgramCache]: Analyzing trace with hash 359739847, now seen corresponding path program 1 times [2019-12-07 16:44:44,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:44:44,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933590279] [2019-12-07 16:44:44,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 174 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:44,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933590279] [2019-12-07 16:44:44,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000034766] [2019-12-07 16:44:44,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/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 16:44:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:44,282 INFO L264 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 16:44:44,286 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:44,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 190 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:44,395 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:44:44,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 16:44:44,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:44:44,517 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 190 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:44,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [134135401] [2019-12-07 16:44:44,536 INFO L159 IcfgInterpreter]: Started Sifa with 82 locations of interest [2019-12-07 16:44:44,536 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:44:44,540 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 16:44:44,544 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 16:44:44,544 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 16:44:56,676 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 128 [2019-12-07 16:44:57,888 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2019-12-07 16:44:59,658 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 32 [2019-12-07 16:44:59,753 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 9044 conjuctions. This might take some time... [2019-12-07 16:44:59,972 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 32 [2019-12-07 16:45:00,040 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 9044 conjuctions. This might take some time... [2019-12-07 16:45:00,298 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 32 [2019-12-07 16:45:00,360 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 9044 conjuctions. This might take some time... [2019-12-07 16:45:02,573 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 128 [2019-12-07 16:45:06,504 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2019-12-07 16:45:08,872 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 16:45:09,021 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-12-07 16:45:09,254 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-12-07 16:45:09,399 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-12-07 16:45:09,624 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-12-07 16:45:10,532 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-12-07 16:45:11,059 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-12-07 16:45:14,623 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 16:45:14,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:45:14,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2019-12-07 16:45:14,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788164832] [2019-12-07 16:45:14,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:45:14,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:45:14,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:45:14,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-07 16:45:14,624 INFO L87 Difference]: Start difference. First operand 643 states and 667 transitions. Second operand 10 states. [2019-12-07 16:45:15,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:45:15,152 INFO L93 Difference]: Finished difference Result 1065 states and 1103 transitions. [2019-12-07 16:45:15,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:45:15,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 213 [2019-12-07 16:45:15,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:45:15,154 INFO L225 Difference]: With dead ends: 1065 [2019-12-07 16:45:15,154 INFO L226 Difference]: Without dead ends: 494 [2019-12-07 16:45:15,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 443 SyntacticMatches, 184 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2940 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-12-07 16:45:15,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-12-07 16:45:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 483. [2019-12-07 16:45:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-12-07 16:45:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 498 transitions. [2019-12-07 16:45:15,160 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 498 transitions. Word has length 213 [2019-12-07 16:45:15,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:45:15,160 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 498 transitions. [2019-12-07 16:45:15,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:45:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 498 transitions. [2019-12-07 16:45:15,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-12-07 16:45:15,162 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:45:15,162 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:45:15,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:45:15,363 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:45:15,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:45:15,363 INFO L82 PathProgramCache]: Analyzing trace with hash -130051743, now seen corresponding path program 1 times [2019-12-07 16:45:15,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:45:15,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016812944] [2019-12-07 16:45:15,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:45:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:45:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 29 proven. 291 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 16:45:15,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016812944] [2019-12-07 16:45:15,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365835412] [2019-12-07 16:45:15,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:45:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:45:15,817 INFO L264 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:45:15,821 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:45:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 310 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:45:16,023 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:45:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 296 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 16:45:16,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1567767523] [2019-12-07 16:45:16,242 INFO L159 IcfgInterpreter]: Started Sifa with 82 locations of interest [2019-12-07 16:45:16,242 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:45:16,242 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 16:45:16,242 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 16:45:16,243 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 16:45:34,369 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:34,522 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:34,712 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:34,865 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:35,091 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 150 [2019-12-07 16:45:35,244 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:35,442 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:35,596 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:35,794 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:35,947 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:36,167 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 150 [2019-12-07 16:45:36,322 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:36,522 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:36,677 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:36,882 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 149 [2019-12-07 16:45:37,033 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-12-07 16:45:37,256 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 149 [2019-12-07 16:45:37,411 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-12-07 16:45:37,628 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 149 [2019-12-07 16:45:37,781 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-12-07 16:45:38,082 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:40,253 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 32 [2019-12-07 16:45:40,323 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 9044 conjuctions. This might take some time... [2019-12-07 16:45:40,563 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 32 [2019-12-07 16:45:40,632 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 9044 conjuctions. This might take some time... [2019-12-07 16:45:40,911 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 32 [2019-12-07 16:45:40,980 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 9044 conjuctions. This might take some time... [2019-12-07 16:45:42,585 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:42,740 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:42,930 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:43,083 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:43,311 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 150 [2019-12-07 16:45:43,465 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:43,655 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:43,807 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:44,007 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:44,160 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:44,382 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 150 [2019-12-07 16:45:44,536 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:44,733 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:44,887 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:45,094 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 149 [2019-12-07 16:45:45,244 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-12-07 16:45:45,469 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 149 [2019-12-07 16:45:45,620 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-12-07 16:45:45,838 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 149 [2019-12-07 16:45:45,991 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-12-07 16:45:46,297 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-12-07 16:45:48,666 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 16:45:48,817 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-12-07 16:45:48,971 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-12-07 16:45:49,147 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2019-12-07 16:45:49,343 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-12-07 16:45:49,603 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-12-07 16:45:58,266 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 16:45:58,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:45:58,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 16 [2019-12-07 16:45:58,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88873322] [2019-12-07 16:45:58,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 16:45:58,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:45:58,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 16:45:58,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-12-07 16:45:58,268 INFO L87 Difference]: Start difference. First operand 483 states and 498 transitions. Second operand 17 states. [2019-12-07 16:45:59,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:45:59,195 INFO L93 Difference]: Finished difference Result 729 states and 755 transitions. [2019-12-07 16:45:59,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:45:59,195 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 263 [2019-12-07 16:45:59,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:45:59,196 INFO L225 Difference]: With dead ends: 729 [2019-12-07 16:45:59,196 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:45:59,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 807 GetRequests, 546 SyntacticMatches, 227 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5399 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=254, Invalid=1006, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 16:45:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:45:59,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:45:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:45:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:45:59,197 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 263 [2019-12-07 16:45:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:45:59,197 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:45:59,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 16:45:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:45:59,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:45:59,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:45:59,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 16:46:00,045 WARN L192 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 74 [2019-12-07 16:46:02,036 WARN L192 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 112 DAG size of output: 74 [2019-12-07 16:46:02,043 INFO L246 CegarLoopResult]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-12-07 16:46:02,043 INFO L246 CegarLoopResult]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-12-07 16:46:02,043 INFO L246 CegarLoopResult]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-12-07 16:46:02,044 INFO L246 CegarLoopResult]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-12-07 16:46:02,044 INFO L246 CegarLoopResult]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 16:46:02,044 INFO L246 CegarLoopResult]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-12-07 16:46:02,045 INFO L246 CegarLoopResult]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-12-07 16:46:02,045 INFO L246 CegarLoopResult]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 16:46:02,045 INFO L246 CegarLoopResult]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-12-07 16:46:02,046 INFO L246 CegarLoopResult]: For program point L505(line 505) no Hoare annotation was computed. [2019-12-07 16:46:02,046 INFO L246 CegarLoopResult]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-12-07 16:46:02,046 INFO L246 CegarLoopResult]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-12-07 16:46:02,047 INFO L246 CegarLoopResult]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-12-07 16:46:02,047 INFO L246 CegarLoopResult]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-12-07 16:46:02,047 INFO L246 CegarLoopResult]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-12-07 16:46:02,048 INFO L246 CegarLoopResult]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-12-07 16:46:02,048 INFO L246 CegarLoopResult]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-12-07 16:46:02,048 INFO L246 CegarLoopResult]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-12-07 16:46:02,049 INFO L246 CegarLoopResult]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-12-07 16:46:02,049 INFO L246 CegarLoopResult]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-12-07 16:46:02,049 INFO L246 CegarLoopResult]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-12-07 16:46:02,049 INFO L246 CegarLoopResult]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-12-07 16:46:02,050 INFO L246 CegarLoopResult]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-12-07 16:46:02,050 INFO L246 CegarLoopResult]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-12-07 16:46:02,050 INFO L246 CegarLoopResult]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-12-07 16:46:02,051 INFO L246 CegarLoopResult]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-12-07 16:46:02,051 INFO L246 CegarLoopResult]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-12-07 16:46:02,051 INFO L246 CegarLoopResult]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-12-07 16:46:02,051 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 16:46:02,052 INFO L246 CegarLoopResult]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-12-07 16:46:02,052 INFO L246 CegarLoopResult]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-12-07 16:46:02,052 INFO L246 CegarLoopResult]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-12-07 16:46:02,052 INFO L246 CegarLoopResult]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-12-07 16:46:02,052 INFO L246 CegarLoopResult]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-12-07 16:46:02,052 INFO L246 CegarLoopResult]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-12-07 16:46:02,053 INFO L246 CegarLoopResult]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-12-07 16:46:02,053 INFO L246 CegarLoopResult]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-12-07 16:46:02,053 INFO L246 CegarLoopResult]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-12-07 16:46:02,053 INFO L246 CegarLoopResult]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-12-07 16:46:02,053 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 505) no Hoare annotation was computed. [2019-12-07 16:46:02,054 INFO L246 CegarLoopResult]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-12-07 16:46:02,054 INFO L246 CegarLoopResult]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-12-07 16:46:02,054 INFO L246 CegarLoopResult]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-12-07 16:46:02,054 INFO L246 CegarLoopResult]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-12-07 16:46:02,056 INFO L242 CegarLoopResult]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse15 (= ~a11~0 1)) (.cse10 (= ~a25~0 1))) (let ((.cse3 (not .cse10)) (.cse9 (= ~a28~0 7)) (.cse8 (= ~a19~0 1)) (.cse11 (not .cse15)) (.cse18 (= ~a28~0 9)) (.cse7 (= ~a17~0 8))) (let ((.cse17 (<= ~a17~0 7)) (.cse16 (or (and .cse18 .cse11) (and .cse18 .cse7))) (.cse4 (<= ~a11~0 0)) (.cse0 (not .cse8)) (.cse6 (or (and .cse3 .cse7 .cse9) (and .cse7 .cse9 .cse11))) (.cse2 (not (= 3 ULTIMATE.start_calculate_output_~input))) (.cse13 (not .cse9)) (.cse12 (not (= ~a28~0 11))) (.cse1 (<= ~a19~0 0)) (.cse5 (= ~a21~0 1))) (or (and .cse0 .cse1 (or .cse2 .cse3) .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11) (and (<= 10 ~a28~0) .cse7 .cse8 .cse5 .cse12) (and (let ((.cse14 (<= ~a25~0 0))) (or (and .cse0 .cse13 .cse7 .cse14 .cse12) (and .cse1 .cse13 .cse14 .cse12) (and .cse1 .cse13 .cse7 .cse14))) .cse15) (and .cse2 (= ~a28~0 8) .cse1 (= ~a25~0 0) .cse7 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse4 .cse5) (and .cse16 .cse8 .cse15) (and .cse17 .cse8 .cse9 .cse10 .cse15) (and .cse17 .cse13 .cse3 .cse8 .cse15) (and .cse7 .cse8 .cse11 .cse5 .cse10 .cse12) (and .cse18 .cse0 .cse10 .cse15) (and .cse16 .cse7 .cse8 .cse4 .cse5) (and .cse0 .cse15 .cse6) (and .cse2 .cse7 .cse8 .cse11 .cse5 .cse10) (and .cse13 .cse7 .cse8 .cse10 .cse15 .cse12) (and (= ~a28~0 10) .cse1 .cse7 .cse10 .cse11 .cse5))))) [2019-12-07 16:46:02,056 INFO L246 CegarLoopResult]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-12-07 16:46:02,056 INFO L246 CegarLoopResult]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-12-07 16:46:02,057 INFO L249 CegarLoopResult]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-12-07 16:46:02,057 INFO L246 CegarLoopResult]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-12-07 16:46:02,057 INFO L246 CegarLoopResult]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-12-07 16:46:02,058 INFO L246 CegarLoopResult]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-12-07 16:46:02,058 INFO L246 CegarLoopResult]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-12-07 16:46:02,058 INFO L246 CegarLoopResult]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-12-07 16:46:02,058 INFO L246 CegarLoopResult]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-12-07 16:46:02,058 INFO L246 CegarLoopResult]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-12-07 16:46:02,059 INFO L242 CegarLoopResult]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse15 (= ~a11~0 1)) (.cse10 (= ~a25~0 1))) (let ((.cse3 (not .cse10)) (.cse9 (= ~a28~0 7)) (.cse8 (= ~a19~0 1)) (.cse11 (not .cse15)) (.cse18 (= ~a28~0 9)) (.cse7 (= ~a17~0 8))) (let ((.cse17 (<= ~a17~0 7)) (.cse16 (or (and .cse18 .cse11) (and .cse18 .cse7))) (.cse4 (<= ~a11~0 0)) (.cse0 (not .cse8)) (.cse6 (or (and .cse3 .cse7 .cse9) (and .cse7 .cse9 .cse11))) (.cse2 (not (= 3 ULTIMATE.start_calculate_output_~input))) (.cse13 (not .cse9)) (.cse12 (not (= ~a28~0 11))) (.cse1 (<= ~a19~0 0)) (.cse5 (= ~a21~0 1))) (or (and .cse0 .cse1 (or .cse2 .cse3) .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse4 .cse9 .cse5) (and .cse7 .cse8 .cse9 .cse10 .cse11) (and (<= 10 ~a28~0) .cse7 .cse8 .cse5 .cse12) (and (let ((.cse14 (<= ~a25~0 0))) (or (and .cse0 .cse13 .cse7 .cse14 .cse12) (and .cse1 .cse13 .cse14 .cse12) (and .cse1 .cse13 .cse7 .cse14))) .cse15) (and .cse2 (= ~a28~0 8) .cse1 (= ~a25~0 0) .cse7 .cse4 .cse5) (and .cse16 .cse8 .cse15) (and .cse17 .cse8 .cse9 .cse10 .cse15) (and .cse17 .cse13 .cse3 .cse8 .cse15) (and .cse7 .cse8 .cse11 .cse5 .cse10 .cse12) (and .cse18 .cse0 .cse10 .cse15) (and .cse16 .cse7 .cse8 .cse4 .cse5) (and .cse0 .cse15 .cse6) (and .cse2 .cse7 .cse8 .cse11 .cse5 .cse10) (and .cse13 .cse7 .cse8 .cse10 .cse15 .cse12) (and (= ~a28~0 10) .cse1 .cse7 .cse10 .cse11 .cse5))))) [2019-12-07 16:46:02,059 INFO L246 CegarLoopResult]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-12-07 16:46:02,059 INFO L246 CegarLoopResult]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-12-07 16:46:02,059 INFO L246 CegarLoopResult]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-12-07 16:46:02,059 INFO L246 CegarLoopResult]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-12-07 16:46:02,060 INFO L246 CegarLoopResult]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-12-07 16:46:02,060 INFO L246 CegarLoopResult]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-12-07 16:46:02,060 INFO L246 CegarLoopResult]: For program point L611(line 611) no Hoare annotation was computed. [2019-12-07 16:46:02,060 INFO L246 CegarLoopResult]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-12-07 16:46:02,060 INFO L246 CegarLoopResult]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-12-07 16:46:02,060 INFO L246 CegarLoopResult]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-12-07 16:46:02,060 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 16:46:02,060 INFO L246 CegarLoopResult]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-12-07 16:46:02,060 INFO L246 CegarLoopResult]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-12-07 16:46:02,061 INFO L246 CegarLoopResult]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-12-07 16:46:02,061 INFO L246 CegarLoopResult]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-12-07 16:46:02,061 INFO L246 CegarLoopResult]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-12-07 16:46:02,061 INFO L246 CegarLoopResult]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-12-07 16:46:02,061 INFO L246 CegarLoopResult]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-12-07 16:46:02,061 INFO L246 CegarLoopResult]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-12-07 16:46:02,061 INFO L246 CegarLoopResult]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-12-07 16:46:02,062 INFO L246 CegarLoopResult]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-12-07 16:46:02,062 INFO L246 CegarLoopResult]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-12-07 16:46:02,062 INFO L246 CegarLoopResult]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-12-07 16:46:02,062 INFO L246 CegarLoopResult]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-12-07 16:46:02,062 INFO L246 CegarLoopResult]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-12-07 16:46:02,062 INFO L246 CegarLoopResult]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-12-07 16:46:02,062 INFO L246 CegarLoopResult]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-12-07 16:46:02,062 INFO L246 CegarLoopResult]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-12-07 16:46:02,063 INFO L246 CegarLoopResult]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-12-07 16:46:02,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:46:02 BoogieIcfgContainer [2019-12-07 16:46:02,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:46:02,096 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:46:02,096 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:46:02,097 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:46:02,097 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:44:37" (3/4) ... [2019-12-07 16:46:02,100 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:46:02,119 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 109 nodes and edges [2019-12-07 16:46:02,120 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 16:46:02,122 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-12-07 16:46:02,123 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 16:46:02,208 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8dbd618d-caa6-43f8-9b0e-c7b134efae33/bin/utaipan/witness.graphml [2019-12-07 16:46:02,208 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:46:02,209 INFO L168 Benchmark]: Toolchain (without parser) took 86003.60 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.0 MB). Free memory was 938.2 MB in the beginning and 915.1 MB in the end (delta: 23.1 MB). Peak memory consumption was 369.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:46:02,209 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:46:02,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -149.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:46:02,210 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:46:02,210 INFO L168 Benchmark]: Boogie Preprocessor took 39.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:46:02,210 INFO L168 Benchmark]: RCFGBuilder took 1133.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 857.2 MB in the end (delta: 219.8 MB). Peak memory consumption was 219.8 MB. Max. memory is 11.5 GB. [2019-12-07 16:46:02,210 INFO L168 Benchmark]: TraceAbstraction took 84284.24 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 857.2 MB in the beginning and 938.7 MB in the end (delta: -81.4 MB). Peak memory consumption was 152.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:46:02,210 INFO L168 Benchmark]: Witness Printer took 112.09 ms. Allocated memory is still 1.4 GB. Free memory was 938.7 MB in the beginning and 915.1 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:46:02,212 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -149.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1133.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 857.2 MB in the end (delta: 219.8 MB). Peak memory consumption was 219.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 84284.24 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 857.2 MB in the beginning and 938.7 MB in the end (delta: -81.4 MB). Peak memory consumption was 152.4 MB. Max. memory is 11.5 GB. * Witness Printer took 112.09 ms. Allocated memory is still 1.4 GB. Free memory was 938.7 MB in the beginning and 915.1 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 505]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(a19 == 1) && a19 <= 0) && (!(3 == input) || !(a25 == 1))) && a11 <= 0) && a21 == 1) && (((!(a25 == 1) && a17 == 8) && a28 == 7) || ((a17 == 8 && a28 == 7) && !(a11 == 1)))) || ((((a17 == 8 && a19 == 1) && a11 <= 0) && a28 == 7) && a21 == 1)) || ((((a17 == 8 && a19 == 1) && a28 == 7) && a25 == 1) && !(a11 == 1))) || ((((10 <= a28 && a17 == 8) && a19 == 1) && a21 == 1) && !(a28 == 11))) || (((((((!(a19 == 1) && !(a28 == 7)) && a17 == 8) && a25 <= 0) && !(a28 == 11)) || (((a19 <= 0 && !(a28 == 7)) && a25 <= 0) && !(a28 == 11))) || (((a19 <= 0 && !(a28 == 7)) && a17 == 8) && a25 <= 0)) && a11 == 1)) || ((((((!(3 == input) && a28 == 8) && a19 <= 0) && a25 == 0) && a17 == 8) && a11 <= 0) && a21 == 1)) || ((((a28 == 9 && !(a11 == 1)) || (a28 == 9 && a17 == 8)) && a19 == 1) && a11 == 1)) || ((((a17 <= 7 && a19 == 1) && a28 == 7) && a25 == 1) && a11 == 1)) || ((((a17 <= 7 && !(a28 == 7)) && !(a25 == 1)) && a19 == 1) && a11 == 1)) || (((((a17 == 8 && a19 == 1) && !(a11 == 1)) && a21 == 1) && a25 == 1) && !(a28 == 11))) || (((a28 == 9 && !(a19 == 1)) && a25 == 1) && a11 == 1)) || ((((((a28 == 9 && !(a11 == 1)) || (a28 == 9 && a17 == 8)) && a17 == 8) && a19 == 1) && a11 <= 0) && a21 == 1)) || ((!(a19 == 1) && a11 == 1) && (((!(a25 == 1) && a17 == 8) && a28 == 7) || ((a17 == 8 && a28 == 7) && !(a11 == 1))))) || (((((!(3 == input) && a17 == 8) && a19 == 1) && !(a11 == 1)) && a21 == 1) && a25 == 1)) || (((((!(a28 == 7) && a17 == 8) && a19 == 1) && a25 == 1) && a11 == 1) && !(a28 == 11))) || (((((a28 == 10 && a19 <= 0) && a17 == 8) && a25 == 1) && !(a11 == 1)) && a21 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(a19 == 1) && a19 <= 0) && (!(3 == input) || !(a25 == 1))) && a11 <= 0) && a21 == 1) && (((!(a25 == 1) && a17 == 8) && a28 == 7) || ((a17 == 8 && a28 == 7) && !(a11 == 1)))) || ((((a17 == 8 && a19 == 1) && a28 == 7) && a25 == 1) && !(a11 == 1))) || ((((10 <= a28 && a17 == 8) && a19 == 1) && a21 == 1) && !(a28 == 11))) || (((((((!(a19 == 1) && !(a28 == 7)) && a17 == 8) && a25 <= 0) && !(a28 == 11)) || (((a19 <= 0 && !(a28 == 7)) && a25 <= 0) && !(a28 == 11))) || (((a19 <= 0 && !(a28 == 7)) && a17 == 8) && a25 <= 0)) && a11 == 1)) || ((((((!(3 == input) && a28 == 8) && a19 <= 0) && a25 == 0) && a17 == 8) && a11 <= 0) && a21 == 1)) || ((((a17 == 8 && a19 == 1) && a28 == 7) && a11 <= 0) && a21 == 1)) || ((((a28 == 9 && !(a11 == 1)) || (a28 == 9 && a17 == 8)) && a19 == 1) && a11 == 1)) || ((((a17 <= 7 && a19 == 1) && a28 == 7) && a25 == 1) && a11 == 1)) || ((((a17 <= 7 && !(a28 == 7)) && !(a25 == 1)) && a19 == 1) && a11 == 1)) || (((((a17 == 8 && a19 == 1) && !(a11 == 1)) && a21 == 1) && a25 == 1) && !(a28 == 11))) || (((a28 == 9 && !(a19 == 1)) && a25 == 1) && a11 == 1)) || ((((((a28 == 9 && !(a11 == 1)) || (a28 == 9 && a17 == 8)) && a17 == 8) && a19 == 1) && a11 <= 0) && a21 == 1)) || ((!(a19 == 1) && a11 == 1) && (((!(a25 == 1) && a17 == 8) && a28 == 7) || ((a17 == 8 && a28 == 7) && !(a11 == 1))))) || (((((!(3 == input) && a17 == 8) && a19 == 1) && !(a11 == 1)) && a21 == 1) && a25 == 1)) || (((((!(a28 == 7) && a17 == 8) && a19 == 1) && a25 == 1) && a11 == 1) && !(a28 == 11))) || (((((a28 == 10 && a19 <= 0) && a17 == 8) && a25 == 1) && !(a11 == 1)) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 81.5s, OverallIterations: 14, TraceHistogramMax: 5, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, HoareTripleCheckerStatistics: 1021 SDtfs, 2540 SDslu, 206 SDs, 0 SdLazy, 6246 SolverSat, 1003 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2529 GetRequests, 2021 SyntacticMatches, 417 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8385 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1363occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 2112 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 54 NumberOfFragments, 775 HoareAnnotationTreeSize, 3 FomulaSimplifications, 7121 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2895 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2901 NumberOfCodeBlocks, 2901 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3867 ConstructedInterpolants, 0 QuantifiedInterpolants, 3995360 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1844 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 24 InterpolantComputations, 15 PerfectInterpolantSequences, 2907/3496 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...