./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/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 8ae4fea535defe079744031ef9589bd179b2820b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/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 8ae4fea535defe079744031ef9589bd179b2820b .................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:26:39,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:26:39,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:26:39,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:26:39,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:26:39,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:26:39,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:26:39,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:26:39,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:26:39,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:26:39,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:26:39,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:26:39,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:26:39,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:26:39,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:26:39,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:26:39,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:26:39,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:26:39,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:26:39,461 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:26:39,468 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:26:39,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:26:39,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:26:39,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:26:39,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:26:39,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:26:39,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:26:39,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:26:39,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:26:39,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:26:39,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:26:39,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:26:39,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:26:39,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:26:39,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:26:39,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:26:39,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:26:39,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:26:39,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:26:39,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:26:39,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:26:39,494 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:26:39,514 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:26:39,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:26:39,515 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:26:39,515 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:26:39,515 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:26:39,515 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:26:39,516 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:26:39,516 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:26:39,516 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:26:39,516 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:26:39,517 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:26:39,517 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:26:39,518 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:26:39,518 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:26:39,518 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:26:39,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:26:39,519 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:26:39,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:26:39,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:26:39,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:26:39,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:26:39,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:26:39,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:26:39,521 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:26:39,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:26:39,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:26:39,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:26:39,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:26:39,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:26:39,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:26:39,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:26:39,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:26:39,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:26:39,523 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:26:39,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:26:39,523 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:26:39,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:26:39,524 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_d3795d32-e76f-4b81-9125-6f5e64022a73/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 -> 8ae4fea535defe079744031ef9589bd179b2820b [2019-11-26 02:26:39,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:26:39,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:26:39,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:26:39,700 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:26:39,700 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:26:39,701 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c [2019-11-26 02:26:39,759 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/data/7a41cedcc/a3259887c0dd42868d64182106d00918/FLAG76f87d710 [2019-11-26 02:26:40,228 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:26:40,229 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c [2019-11-26 02:26:40,250 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/data/7a41cedcc/a3259887c0dd42868d64182106d00918/FLAG76f87d710 [2019-11-26 02:26:40,540 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/data/7a41cedcc/a3259887c0dd42868d64182106d00918 [2019-11-26 02:26:40,543 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:26:40,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:26:40,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:26:40,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:26:40,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:26:40,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:26:40" (1/1) ... [2019-11-26 02:26:40,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7265be6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:40, skipping insertion in model container [2019-11-26 02:26:40,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:26:40" (1/1) ... [2019-11-26 02:26:40,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:26:40,623 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:26:41,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:26:41,157 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:26:41,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:26:41,300 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:26:41,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:41 WrapperNode [2019-11-26 02:26:41,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:26:41,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:26:41,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:26:41,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:26:41,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:41" (1/1) ... [2019-11-26 02:26:41,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:41" (1/1) ... [2019-11-26 02:26:41,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:26:41,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:26:41,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:26:41,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:26:41,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:41" (1/1) ... [2019-11-26 02:26:41,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:41" (1/1) ... [2019-11-26 02:26:41,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:41" (1/1) ... [2019-11-26 02:26:41,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:41" (1/1) ... [2019-11-26 02:26:41,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:41" (1/1) ... [2019-11-26 02:26:41,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:41" (1/1) ... [2019-11-26 02:26:41,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:41" (1/1) ... [2019-11-26 02:26:41,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:26:41,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:26:41,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:26:41,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:26:41,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/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-11-26 02:26:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 02:26:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:26:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:26:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 02:26:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 02:26:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:26:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:26:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:26:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:26:41,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:26:41,761 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:26:42,521 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-26 02:26:42,521 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-26 02:26:43,254 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:26:43,254 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:26:43,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:26:43 BoogieIcfgContainer [2019-11-26 02:26:43,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:26:43,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:26:43,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:26:43,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:26:43,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:26:40" (1/3) ... [2019-11-26 02:26:43,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0b600b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:26:43, skipping insertion in model container [2019-11-26 02:26:43,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:26:41" (2/3) ... [2019-11-26 02:26:43,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0b600b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:26:43, skipping insertion in model container [2019-11-26 02:26:43,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:26:43" (3/3) ... [2019-11-26 02:26:43,262 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-2.c [2019-11-26 02:26:43,271 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:26:43,277 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:26:43,287 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:26:43,309 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:26:43,310 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:26:43,310 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:26:43,310 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:26:43,310 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:26:43,310 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:26:43,311 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:26:43,311 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:26:43,335 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2019-11-26 02:26:43,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-26 02:26:43,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:43,351 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] [2019-11-26 02:26:43,351 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:43,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:43,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1770610287, now seen corresponding path program 1 times [2019-11-26 02:26:43,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:43,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728445377] [2019-11-26 02:26:43,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:43,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728445377] [2019-11-26 02:26:43,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:43,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:26:43,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153568728] [2019-11-26 02:26:43,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:43,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:43,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:43,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:43,680 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 4 states. [2019-11-26 02:26:44,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:44,117 INFO L93 Difference]: Finished difference Result 241 states and 416 transitions. [2019-11-26 02:26:44,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:44,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-26 02:26:44,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:44,130 INFO L225 Difference]: With dead ends: 241 [2019-11-26 02:26:44,130 INFO L226 Difference]: Without dead ends: 128 [2019-11-26 02:26:44,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:44,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-26 02:26:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2019-11-26 02:26:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:26:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 177 transitions. [2019-11-26 02:26:44,173 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 177 transitions. Word has length 36 [2019-11-26 02:26:44,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:44,173 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 177 transitions. [2019-11-26 02:26:44,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:44,174 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 177 transitions. [2019-11-26 02:26:44,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-26 02:26:44,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:44,176 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:26:44,176 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:44,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:44,177 INFO L82 PathProgramCache]: Analyzing trace with hash 2024541219, now seen corresponding path program 1 times [2019-11-26 02:26:44,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:44,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520333112] [2019-11-26 02:26:44,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:44,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520333112] [2019-11-26 02:26:44,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:44,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:26:44,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905831019] [2019-11-26 02:26:44,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:44,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:44,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:44,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:44,320 INFO L87 Difference]: Start difference. First operand 116 states and 177 transitions. Second operand 4 states. [2019-11-26 02:26:44,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:44,611 INFO L93 Difference]: Finished difference Result 232 states and 348 transitions. [2019-11-26 02:26:44,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:44,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-26 02:26:44,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:44,613 INFO L225 Difference]: With dead ends: 232 [2019-11-26 02:26:44,613 INFO L226 Difference]: Without dead ends: 128 [2019-11-26 02:26:44,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:44,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-26 02:26:44,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2019-11-26 02:26:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:26:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 176 transitions. [2019-11-26 02:26:44,632 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 176 transitions. Word has length 46 [2019-11-26 02:26:44,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:44,633 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 176 transitions. [2019-11-26 02:26:44,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 176 transitions. [2019-11-26 02:26:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 02:26:44,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:44,637 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] [2019-11-26 02:26:44,637 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:44,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:44,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1517590108, now seen corresponding path program 1 times [2019-11-26 02:26:44,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:44,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324537206] [2019-11-26 02:26:44,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:44,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324537206] [2019-11-26 02:26:44,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:44,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:26:44,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097560715] [2019-11-26 02:26:44,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:44,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:44,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:44,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:44,746 INFO L87 Difference]: Start difference. First operand 116 states and 176 transitions. Second operand 4 states. [2019-11-26 02:26:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:45,053 INFO L93 Difference]: Finished difference Result 232 states and 347 transitions. [2019-11-26 02:26:45,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:45,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-26 02:26:45,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:45,055 INFO L225 Difference]: With dead ends: 232 [2019-11-26 02:26:45,056 INFO L226 Difference]: Without dead ends: 128 [2019-11-26 02:26:45,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:45,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-26 02:26:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2019-11-26 02:26:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:26:45,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 175 transitions. [2019-11-26 02:26:45,077 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 175 transitions. Word has length 47 [2019-11-26 02:26:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:45,078 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 175 transitions. [2019-11-26 02:26:45,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 175 transitions. [2019-11-26 02:26:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-26 02:26:45,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:45,080 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:26:45,080 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:45,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:45,080 INFO L82 PathProgramCache]: Analyzing trace with hash -332180423, now seen corresponding path program 1 times [2019-11-26 02:26:45,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:45,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673223548] [2019-11-26 02:26:45,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:45,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673223548] [2019-11-26 02:26:45,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:45,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:26:45,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324081998] [2019-11-26 02:26:45,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:45,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:45,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:45,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:45,146 INFO L87 Difference]: Start difference. First operand 116 states and 175 transitions. Second operand 4 states. [2019-11-26 02:26:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:45,399 INFO L93 Difference]: Finished difference Result 232 states and 346 transitions. [2019-11-26 02:26:45,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:45,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-26 02:26:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:45,402 INFO L225 Difference]: With dead ends: 232 [2019-11-26 02:26:45,402 INFO L226 Difference]: Without dead ends: 128 [2019-11-26 02:26:45,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:45,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-26 02:26:45,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2019-11-26 02:26:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:26:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 174 transitions. [2019-11-26 02:26:45,411 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 174 transitions. Word has length 48 [2019-11-26 02:26:45,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:45,412 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 174 transitions. [2019-11-26 02:26:45,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 174 transitions. [2019-11-26 02:26:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-26 02:26:45,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:45,414 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:26:45,414 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:45,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:45,414 INFO L82 PathProgramCache]: Analyzing trace with hash 560620292, now seen corresponding path program 1 times [2019-11-26 02:26:45,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:45,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444955062] [2019-11-26 02:26:45,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:45,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444955062] [2019-11-26 02:26:45,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:45,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:26:45,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540911788] [2019-11-26 02:26:45,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:45,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:45,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:45,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:45,491 INFO L87 Difference]: Start difference. First operand 116 states and 174 transitions. Second operand 4 states. [2019-11-26 02:26:45,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:45,745 INFO L93 Difference]: Finished difference Result 232 states and 345 transitions. [2019-11-26 02:26:45,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:45,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-26 02:26:45,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:45,747 INFO L225 Difference]: With dead ends: 232 [2019-11-26 02:26:45,747 INFO L226 Difference]: Without dead ends: 128 [2019-11-26 02:26:45,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-26 02:26:45,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2019-11-26 02:26:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:26:45,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 173 transitions. [2019-11-26 02:26:45,755 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 173 transitions. Word has length 48 [2019-11-26 02:26:45,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:45,755 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 173 transitions. [2019-11-26 02:26:45,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:45,756 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 173 transitions. [2019-11-26 02:26:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-26 02:26:45,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:45,756 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] [2019-11-26 02:26:45,757 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:45,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:45,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1069562714, now seen corresponding path program 1 times [2019-11-26 02:26:45,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:45,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182145270] [2019-11-26 02:26:45,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:45,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182145270] [2019-11-26 02:26:45,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:45,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:26:45,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561749009] [2019-11-26 02:26:45,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:45,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:45,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:45,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:45,837 INFO L87 Difference]: Start difference. First operand 116 states and 173 transitions. Second operand 4 states. [2019-11-26 02:26:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:46,090 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2019-11-26 02:26:46,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:46,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-26 02:26:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:46,094 INFO L225 Difference]: With dead ends: 232 [2019-11-26 02:26:46,094 INFO L226 Difference]: Without dead ends: 128 [2019-11-26 02:26:46,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:46,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-26 02:26:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2019-11-26 02:26:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:26:46,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2019-11-26 02:26:46,100 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 48 [2019-11-26 02:26:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:46,101 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2019-11-26 02:26:46,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:46,101 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2019-11-26 02:26:46,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-26 02:26:46,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:46,102 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:26:46,102 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:46,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:46,102 INFO L82 PathProgramCache]: Analyzing trace with hash -187701751, now seen corresponding path program 1 times [2019-11-26 02:26:46,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:46,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485917252] [2019-11-26 02:26:46,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:46,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485917252] [2019-11-26 02:26:46,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:46,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:26:46,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408582198] [2019-11-26 02:26:46,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:46,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:46,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:46,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:46,150 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand 4 states. [2019-11-26 02:26:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:46,414 INFO L93 Difference]: Finished difference Result 232 states and 343 transitions. [2019-11-26 02:26:46,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:46,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-26 02:26:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:46,416 INFO L225 Difference]: With dead ends: 232 [2019-11-26 02:26:46,416 INFO L226 Difference]: Without dead ends: 128 [2019-11-26 02:26:46,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:46,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-26 02:26:46,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2019-11-26 02:26:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:26:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 171 transitions. [2019-11-26 02:26:46,422 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 171 transitions. Word has length 49 [2019-11-26 02:26:46,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:46,423 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 171 transitions. [2019-11-26 02:26:46,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 171 transitions. [2019-11-26 02:26:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-26 02:26:46,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:46,424 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:26:46,424 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:46,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:46,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1044936241, now seen corresponding path program 1 times [2019-11-26 02:26:46,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:46,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969109293] [2019-11-26 02:26:46,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:46,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:46,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969109293] [2019-11-26 02:26:46,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:46,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:26:46,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126870536] [2019-11-26 02:26:46,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:46,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:46,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:46,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:46,531 INFO L87 Difference]: Start difference. First operand 116 states and 171 transitions. Second operand 4 states. [2019-11-26 02:26:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:46,821 INFO L93 Difference]: Finished difference Result 230 states and 340 transitions. [2019-11-26 02:26:46,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:46,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-26 02:26:46,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:46,823 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:26:46,823 INFO L226 Difference]: Without dead ends: 126 [2019-11-26 02:26:46,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:46,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-26 02:26:46,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2019-11-26 02:26:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:26:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2019-11-26 02:26:46,828 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 49 [2019-11-26 02:26:46,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:46,828 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2019-11-26 02:26:46,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:46,829 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2019-11-26 02:26:46,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 02:26:46,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:46,829 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:26:46,830 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:46,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:46,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2047653886, now seen corresponding path program 1 times [2019-11-26 02:26:46,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:46,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341677838] [2019-11-26 02:26:46,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:46,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341677838] [2019-11-26 02:26:46,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:46,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:26:46,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692160183] [2019-11-26 02:26:46,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:46,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:46,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:46,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:46,878 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand 4 states. [2019-11-26 02:26:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:47,097 INFO L93 Difference]: Finished difference Result 222 states and 329 transitions. [2019-11-26 02:26:47,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:47,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-26 02:26:47,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:47,099 INFO L225 Difference]: With dead ends: 222 [2019-11-26 02:26:47,099 INFO L226 Difference]: Without dead ends: 118 [2019-11-26 02:26:47,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-26 02:26:47,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2019-11-26 02:26:47,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:26:47,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 169 transitions. [2019-11-26 02:26:47,104 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 169 transitions. Word has length 50 [2019-11-26 02:26:47,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:47,104 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 169 transitions. [2019-11-26 02:26:47,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 169 transitions. [2019-11-26 02:26:47,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 02:26:47,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:47,105 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:26:47,105 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:47,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:47,106 INFO L82 PathProgramCache]: Analyzing trace with hash -698276711, now seen corresponding path program 1 times [2019-11-26 02:26:47,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:47,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438037540] [2019-11-26 02:26:47,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:47,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438037540] [2019-11-26 02:26:47,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:47,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:47,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710522516] [2019-11-26 02:26:47,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:47,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:47,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:47,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:47,193 INFO L87 Difference]: Start difference. First operand 116 states and 169 transitions. Second operand 4 states. [2019-11-26 02:26:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:47,488 INFO L93 Difference]: Finished difference Result 254 states and 377 transitions. [2019-11-26 02:26:47,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:47,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-26 02:26:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:47,491 INFO L225 Difference]: With dead ends: 254 [2019-11-26 02:26:47,491 INFO L226 Difference]: Without dead ends: 150 [2019-11-26 02:26:47,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:47,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-26 02:26:47,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2019-11-26 02:26:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-26 02:26:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 203 transitions. [2019-11-26 02:26:47,497 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 203 transitions. Word has length 51 [2019-11-26 02:26:47,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:47,497 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 203 transitions. [2019-11-26 02:26:47,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 203 transitions. [2019-11-26 02:26:47,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-26 02:26:47,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:47,499 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:26:47,499 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:47,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:47,500 INFO L82 PathProgramCache]: Analyzing trace with hash 179594539, now seen corresponding path program 1 times [2019-11-26 02:26:47,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:47,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344251682] [2019-11-26 02:26:47,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:47,583 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:47,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344251682] [2019-11-26 02:26:47,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:47,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:47,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384002710] [2019-11-26 02:26:47,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:47,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:47,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:47,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:47,585 INFO L87 Difference]: Start difference. First operand 136 states and 203 transitions. Second operand 4 states. [2019-11-26 02:26:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:47,845 INFO L93 Difference]: Finished difference Result 274 states and 410 transitions. [2019-11-26 02:26:47,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:47,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-26 02:26:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:47,847 INFO L225 Difference]: With dead ends: 274 [2019-11-26 02:26:47,847 INFO L226 Difference]: Without dead ends: 150 [2019-11-26 02:26:47,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:47,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-26 02:26:47,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2019-11-26 02:26:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-26 02:26:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 202 transitions. [2019-11-26 02:26:47,853 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 202 transitions. Word has length 61 [2019-11-26 02:26:47,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:47,853 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 202 transitions. [2019-11-26 02:26:47,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 202 transitions. [2019-11-26 02:26:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-26 02:26:47,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:47,854 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:26:47,854 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1418604956, now seen corresponding path program 1 times [2019-11-26 02:26:47,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:47,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110271360] [2019-11-26 02:26:47,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:26:47,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110271360] [2019-11-26 02:26:47,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:47,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:26:47,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285029979] [2019-11-26 02:26:47,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:26:47,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:47,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:26:47,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:47,921 INFO L87 Difference]: Start difference. First operand 136 states and 202 transitions. Second operand 5 states. [2019-11-26 02:26:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:48,312 INFO L93 Difference]: Finished difference Result 277 states and 415 transitions. [2019-11-26 02:26:48,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:26:48,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-11-26 02:26:48,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:48,313 INFO L225 Difference]: With dead ends: 277 [2019-11-26 02:26:48,314 INFO L226 Difference]: Without dead ends: 153 [2019-11-26 02:26:48,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:26:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-26 02:26:48,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2019-11-26 02:26:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-26 02:26:48,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 222 transitions. [2019-11-26 02:26:48,319 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 222 transitions. Word has length 62 [2019-11-26 02:26:48,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:48,320 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 222 transitions. [2019-11-26 02:26:48,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:26:48,320 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 222 transitions. [2019-11-26 02:26:48,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-26 02:26:48,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:48,321 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:26:48,321 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:48,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:48,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1388354060, now seen corresponding path program 1 times [2019-11-26 02:26:48,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:48,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398494695] [2019-11-26 02:26:48,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:48,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398494695] [2019-11-26 02:26:48,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:48,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:48,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048518566] [2019-11-26 02:26:48,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:48,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:48,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:48,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:48,377 INFO L87 Difference]: Start difference. First operand 152 states and 222 transitions. Second operand 4 states. [2019-11-26 02:26:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:48,667 INFO L93 Difference]: Finished difference Result 306 states and 447 transitions. [2019-11-26 02:26:48,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:48,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-26 02:26:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:48,669 INFO L225 Difference]: With dead ends: 306 [2019-11-26 02:26:48,669 INFO L226 Difference]: Without dead ends: 166 [2019-11-26 02:26:48,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-26 02:26:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 152. [2019-11-26 02:26:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-26 02:26:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 221 transitions. [2019-11-26 02:26:48,676 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 221 transitions. Word has length 63 [2019-11-26 02:26:48,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:48,677 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 221 transitions. [2019-11-26 02:26:48,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 221 transitions. [2019-11-26 02:26:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-26 02:26:48,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:48,678 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:26:48,678 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:48,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:48,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1897296482, now seen corresponding path program 1 times [2019-11-26 02:26:48,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:48,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203764421] [2019-11-26 02:26:48,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:48,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203764421] [2019-11-26 02:26:48,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:48,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:48,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641739802] [2019-11-26 02:26:48,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:48,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:48,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:48,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:48,725 INFO L87 Difference]: Start difference. First operand 152 states and 221 transitions. Second operand 4 states. [2019-11-26 02:26:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:49,048 INFO L93 Difference]: Finished difference Result 306 states and 445 transitions. [2019-11-26 02:26:49,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:49,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-26 02:26:49,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:49,051 INFO L225 Difference]: With dead ends: 306 [2019-11-26 02:26:49,051 INFO L226 Difference]: Without dead ends: 166 [2019-11-26 02:26:49,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:49,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-26 02:26:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 152. [2019-11-26 02:26:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-26 02:26:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 220 transitions. [2019-11-26 02:26:49,058 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 220 transitions. Word has length 63 [2019-11-26 02:26:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:49,058 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 220 transitions. [2019-11-26 02:26:49,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 220 transitions. [2019-11-26 02:26:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-26 02:26:49,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:49,060 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:26:49,060 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:49,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:49,060 INFO L82 PathProgramCache]: Analyzing trace with hash 673432476, now seen corresponding path program 1 times [2019-11-26 02:26:49,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:49,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419197022] [2019-11-26 02:26:49,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:49,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419197022] [2019-11-26 02:26:49,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:49,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:49,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016928993] [2019-11-26 02:26:49,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:49,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:49,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:49,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:49,150 INFO L87 Difference]: Start difference. First operand 152 states and 220 transitions. Second operand 4 states. [2019-11-26 02:26:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:49,453 INFO L93 Difference]: Finished difference Result 306 states and 443 transitions. [2019-11-26 02:26:49,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:49,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-26 02:26:49,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:49,456 INFO L225 Difference]: With dead ends: 306 [2019-11-26 02:26:49,456 INFO L226 Difference]: Without dead ends: 166 [2019-11-26 02:26:49,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-26 02:26:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 152. [2019-11-26 02:26:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-26 02:26:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 219 transitions. [2019-11-26 02:26:49,462 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 219 transitions. Word has length 63 [2019-11-26 02:26:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:49,462 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 219 transitions. [2019-11-26 02:26:49,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 219 transitions. [2019-11-26 02:26:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-26 02:26:49,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:49,464 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:26:49,464 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:49,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2123603607, now seen corresponding path program 1 times [2019-11-26 02:26:49,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:49,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216260300] [2019-11-26 02:26:49,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:49,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216260300] [2019-11-26 02:26:49,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:49,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:49,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092115120] [2019-11-26 02:26:49,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:49,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:49,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:49,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:49,506 INFO L87 Difference]: Start difference. First operand 152 states and 219 transitions. Second operand 4 states. [2019-11-26 02:26:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:49,780 INFO L93 Difference]: Finished difference Result 306 states and 441 transitions. [2019-11-26 02:26:49,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:49,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-26 02:26:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:49,782 INFO L225 Difference]: With dead ends: 306 [2019-11-26 02:26:49,782 INFO L226 Difference]: Without dead ends: 166 [2019-11-26 02:26:49,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-26 02:26:49,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 152. [2019-11-26 02:26:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-26 02:26:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 218 transitions. [2019-11-26 02:26:49,788 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 218 transitions. Word has length 64 [2019-11-26 02:26:49,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:49,789 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 218 transitions. [2019-11-26 02:26:49,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 218 transitions. [2019-11-26 02:26:49,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-26 02:26:49,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:49,789 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-11-26 02:26:49,790 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:49,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:49,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1154993209, now seen corresponding path program 1 times [2019-11-26 02:26:49,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:49,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846823996] [2019-11-26 02:26:49,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:49,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846823996] [2019-11-26 02:26:49,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:49,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:49,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460179231] [2019-11-26 02:26:49,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:49,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:49,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:49,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:49,831 INFO L87 Difference]: Start difference. First operand 152 states and 218 transitions. Second operand 4 states. [2019-11-26 02:26:50,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:50,099 INFO L93 Difference]: Finished difference Result 304 states and 437 transitions. [2019-11-26 02:26:50,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:50,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-26 02:26:50,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:50,101 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:26:50,101 INFO L226 Difference]: Without dead ends: 164 [2019-11-26 02:26:50,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:50,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-26 02:26:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-11-26 02:26:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-26 02:26:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 217 transitions. [2019-11-26 02:26:50,107 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 217 transitions. Word has length 64 [2019-11-26 02:26:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:50,108 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 217 transitions. [2019-11-26 02:26:50,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 217 transitions. [2019-11-26 02:26:50,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-26 02:26:50,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:50,109 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-11-26 02:26:50,109 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:50,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:50,109 INFO L82 PathProgramCache]: Analyzing trace with hash -994233897, now seen corresponding path program 1 times [2019-11-26 02:26:50,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:50,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028086999] [2019-11-26 02:26:50,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:50,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028086999] [2019-11-26 02:26:50,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:50,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:50,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996995067] [2019-11-26 02:26:50,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:50,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:50,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:50,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:50,161 INFO L87 Difference]: Start difference. First operand 152 states and 217 transitions. Second operand 4 states. [2019-11-26 02:26:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:50,435 INFO L93 Difference]: Finished difference Result 304 states and 435 transitions. [2019-11-26 02:26:50,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:50,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-26 02:26:50,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:50,437 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:26:50,437 INFO L226 Difference]: Without dead ends: 164 [2019-11-26 02:26:50,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-26 02:26:50,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-11-26 02:26:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-26 02:26:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 216 transitions. [2019-11-26 02:26:50,443 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 216 transitions. Word has length 65 [2019-11-26 02:26:50,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:50,444 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 216 transitions. [2019-11-26 02:26:50,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:50,444 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2019-11-26 02:26:50,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-26 02:26:50,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:50,444 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-11-26 02:26:50,445 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:50,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:50,445 INFO L82 PathProgramCache]: Analyzing trace with hash 308548978, now seen corresponding path program 1 times [2019-11-26 02:26:50,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:50,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035215886] [2019-11-26 02:26:50,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:50,484 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:26:50,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035215886] [2019-11-26 02:26:50,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:50,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:50,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964597724] [2019-11-26 02:26:50,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:50,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:50,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:50,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:50,486 INFO L87 Difference]: Start difference. First operand 152 states and 216 transitions. Second operand 4 states. [2019-11-26 02:26:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:50,757 INFO L93 Difference]: Finished difference Result 296 states and 424 transitions. [2019-11-26 02:26:50,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:50,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-26 02:26:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:50,760 INFO L225 Difference]: With dead ends: 296 [2019-11-26 02:26:50,760 INFO L226 Difference]: Without dead ends: 156 [2019-11-26 02:26:50,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:50,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-26 02:26:50,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2019-11-26 02:26:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-26 02:26:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 215 transitions. [2019-11-26 02:26:50,766 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 215 transitions. Word has length 66 [2019-11-26 02:26:50,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:50,766 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 215 transitions. [2019-11-26 02:26:50,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 215 transitions. [2019-11-26 02:26:50,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-26 02:26:50,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:50,767 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:26:50,767 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:50,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:50,767 INFO L82 PathProgramCache]: Analyzing trace with hash -407440097, now seen corresponding path program 1 times [2019-11-26 02:26:50,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:50,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120695653] [2019-11-26 02:26:50,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:26:50,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120695653] [2019-11-26 02:26:50,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:50,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:26:50,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032186974] [2019-11-26 02:26:50,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:26:50,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:50,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:26:50,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:26:50,880 INFO L87 Difference]: Start difference. First operand 152 states and 215 transitions. Second operand 6 states. [2019-11-26 02:26:51,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:51,423 INFO L93 Difference]: Finished difference Result 387 states and 559 transitions. [2019-11-26 02:26:51,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:26:51,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-26 02:26:51,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:51,425 INFO L225 Difference]: With dead ends: 387 [2019-11-26 02:26:51,425 INFO L226 Difference]: Without dead ends: 247 [2019-11-26 02:26:51,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:26:51,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-11-26 02:26:51,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 189. [2019-11-26 02:26:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-26 02:26:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 282 transitions. [2019-11-26 02:26:51,433 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 282 transitions. Word has length 69 [2019-11-26 02:26:51,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:51,433 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 282 transitions. [2019-11-26 02:26:51,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:26:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 282 transitions. [2019-11-26 02:26:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-26 02:26:51,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:51,435 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:26:51,435 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:51,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:51,435 INFO L82 PathProgramCache]: Analyzing trace with hash 13062579, now seen corresponding path program 1 times [2019-11-26 02:26:51,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:51,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687278554] [2019-11-26 02:26:51,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:26:51,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687278554] [2019-11-26 02:26:51,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:51,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:26:51,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287655460] [2019-11-26 02:26:51,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:26:51,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:51,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:26:51,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:26:51,581 INFO L87 Difference]: Start difference. First operand 189 states and 282 transitions. Second operand 6 states. [2019-11-26 02:26:52,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:52,128 INFO L93 Difference]: Finished difference Result 418 states and 618 transitions. [2019-11-26 02:26:52,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:26:52,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-26 02:26:52,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:52,130 INFO L225 Difference]: With dead ends: 418 [2019-11-26 02:26:52,130 INFO L226 Difference]: Without dead ends: 241 [2019-11-26 02:26:52,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:26:52,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-26 02:26:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 190. [2019-11-26 02:26:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-26 02:26:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 283 transitions. [2019-11-26 02:26:52,138 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 283 transitions. Word has length 70 [2019-11-26 02:26:52,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:52,138 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 283 transitions. [2019-11-26 02:26:52,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:26:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 283 transitions. [2019-11-26 02:26:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-26 02:26:52,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:52,140 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-26 02:26:52,140 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:52,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:52,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1517539730, now seen corresponding path program 1 times [2019-11-26 02:26:52,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:52,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207606398] [2019-11-26 02:26:52,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:52,202 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-26 02:26:52,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207606398] [2019-11-26 02:26:52,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:52,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:52,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63800942] [2019-11-26 02:26:52,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:52,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:52,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:52,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:52,204 INFO L87 Difference]: Start difference. First operand 190 states and 283 transitions. Second operand 4 states. [2019-11-26 02:26:52,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:52,576 INFO L93 Difference]: Finished difference Result 430 states and 648 transitions. [2019-11-26 02:26:52,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:52,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-26 02:26:52,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:52,580 INFO L225 Difference]: With dead ends: 430 [2019-11-26 02:26:52,580 INFO L226 Difference]: Without dead ends: 252 [2019-11-26 02:26:52,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:52,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-11-26 02:26:52,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 220. [2019-11-26 02:26:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-26 02:26:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 336 transitions. [2019-11-26 02:26:52,589 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 336 transitions. Word has length 81 [2019-11-26 02:26:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:52,590 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 336 transitions. [2019-11-26 02:26:52,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 336 transitions. [2019-11-26 02:26:52,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-26 02:26:52,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:52,591 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-26 02:26:52,591 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:52,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:52,591 INFO L82 PathProgramCache]: Analyzing trace with hash 2026482152, now seen corresponding path program 1 times [2019-11-26 02:26:52,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:52,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941517619] [2019-11-26 02:26:52,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:26:52,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941517619] [2019-11-26 02:26:52,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:52,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:52,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102117176] [2019-11-26 02:26:52,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:52,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:52,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:52,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:52,670 INFO L87 Difference]: Start difference. First operand 220 states and 336 transitions. Second operand 4 states. [2019-11-26 02:26:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:53,127 INFO L93 Difference]: Finished difference Result 519 states and 796 transitions. [2019-11-26 02:26:53,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:53,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-26 02:26:53,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:53,130 INFO L225 Difference]: With dead ends: 519 [2019-11-26 02:26:53,130 INFO L226 Difference]: Without dead ends: 311 [2019-11-26 02:26:53,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-11-26 02:26:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 257. [2019-11-26 02:26:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-26 02:26:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 403 transitions. [2019-11-26 02:26:53,141 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 403 transitions. Word has length 81 [2019-11-26 02:26:53,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:53,141 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 403 transitions. [2019-11-26 02:26:53,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:53,141 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 403 transitions. [2019-11-26 02:26:53,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-26 02:26:53,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:53,143 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:26:53,143 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:53,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:53,143 INFO L82 PathProgramCache]: Analyzing trace with hash 802618146, now seen corresponding path program 1 times [2019-11-26 02:26:53,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:53,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061011692] [2019-11-26 02:26:53,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:26:53,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061011692] [2019-11-26 02:26:53,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:53,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:26:53,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163345346] [2019-11-26 02:26:53,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:26:53,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:53,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:26:53,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:53,235 INFO L87 Difference]: Start difference. First operand 257 states and 403 transitions. Second operand 5 states. [2019-11-26 02:26:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:53,708 INFO L93 Difference]: Finished difference Result 603 states and 946 transitions. [2019-11-26 02:26:53,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:53,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-26 02:26:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:53,711 INFO L225 Difference]: With dead ends: 603 [2019-11-26 02:26:53,711 INFO L226 Difference]: Without dead ends: 358 [2019-11-26 02:26:53,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:26:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-26 02:26:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 257. [2019-11-26 02:26:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-26 02:26:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 403 transitions. [2019-11-26 02:26:53,721 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 403 transitions. Word has length 81 [2019-11-26 02:26:53,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:53,722 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 403 transitions. [2019-11-26 02:26:53,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:26:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 403 transitions. [2019-11-26 02:26:53,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-26 02:26:53,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:53,723 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-26 02:26:53,724 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:53,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:53,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1844759030, now seen corresponding path program 1 times [2019-11-26 02:26:53,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:53,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997647787] [2019-11-26 02:26:53,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:26:53,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997647787] [2019-11-26 02:26:53,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:53,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:53,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322116069] [2019-11-26 02:26:53,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:53,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:53,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:53,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:53,783 INFO L87 Difference]: Start difference. First operand 257 states and 403 transitions. Second operand 4 states. [2019-11-26 02:26:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:54,241 INFO L93 Difference]: Finished difference Result 587 states and 922 transitions. [2019-11-26 02:26:54,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:54,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-26 02:26:54,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:54,244 INFO L225 Difference]: With dead ends: 587 [2019-11-26 02:26:54,244 INFO L226 Difference]: Without dead ends: 342 [2019-11-26 02:26:54,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:54,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-11-26 02:26:54,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 257. [2019-11-26 02:26:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-26 02:26:54,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 403 transitions. [2019-11-26 02:26:54,254 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 403 transitions. Word has length 82 [2019-11-26 02:26:54,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:54,255 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 403 transitions. [2019-11-26 02:26:54,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 403 transitions. [2019-11-26 02:26:54,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-26 02:26:54,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:54,256 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:26:54,257 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:54,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:54,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1129837552, now seen corresponding path program 1 times [2019-11-26 02:26:54,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:54,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718409003] [2019-11-26 02:26:54,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:26:54,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718409003] [2019-11-26 02:26:54,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:54,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:26:54,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196448538] [2019-11-26 02:26:54,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:26:54,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:54,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:26:54,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:54,365 INFO L87 Difference]: Start difference. First operand 257 states and 403 transitions. Second operand 5 states. [2019-11-26 02:26:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:54,920 INFO L93 Difference]: Finished difference Result 594 states and 934 transitions. [2019-11-26 02:26:54,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:54,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-11-26 02:26:54,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:54,923 INFO L225 Difference]: With dead ends: 594 [2019-11-26 02:26:54,923 INFO L226 Difference]: Without dead ends: 349 [2019-11-26 02:26:54,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:26:54,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-11-26 02:26:54,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 248. [2019-11-26 02:26:54,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-26 02:26:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 392 transitions. [2019-11-26 02:26:54,935 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 392 transitions. Word has length 82 [2019-11-26 02:26:54,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:54,935 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 392 transitions. [2019-11-26 02:26:54,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:26:54,936 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 392 transitions. [2019-11-26 02:26:54,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-26 02:26:54,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:54,937 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-26 02:26:54,937 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:54,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:54,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1833671277, now seen corresponding path program 1 times [2019-11-26 02:26:54,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:54,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537263779] [2019-11-26 02:26:54,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:26:55,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537263779] [2019-11-26 02:26:55,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:55,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:26:55,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684184417] [2019-11-26 02:26:55,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:26:55,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:55,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:26:55,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:26:55,036 INFO L87 Difference]: Start difference. First operand 248 states and 392 transitions. Second operand 6 states. [2019-11-26 02:26:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:55,574 INFO L93 Difference]: Finished difference Result 570 states and 900 transitions. [2019-11-26 02:26:55,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:26:55,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-11-26 02:26:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:55,577 INFO L225 Difference]: With dead ends: 570 [2019-11-26 02:26:55,577 INFO L226 Difference]: Without dead ends: 334 [2019-11-26 02:26:55,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:26:55,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-11-26 02:26:55,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 278. [2019-11-26 02:26:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-11-26 02:26:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 445 transitions. [2019-11-26 02:26:55,588 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 445 transitions. Word has length 97 [2019-11-26 02:26:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:55,589 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 445 transitions. [2019-11-26 02:26:55,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:26:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 445 transitions. [2019-11-26 02:26:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-26 02:26:55,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:55,590 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:26:55,591 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:55,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:55,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1053404460, now seen corresponding path program 1 times [2019-11-26 02:26:55,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:55,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179538594] [2019-11-26 02:26:55,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:26:55,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179538594] [2019-11-26 02:26:55,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:55,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:26:55,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183739296] [2019-11-26 02:26:55,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:26:55,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:55,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:26:55,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:26:55,689 INFO L87 Difference]: Start difference. First operand 278 states and 445 transitions. Second operand 6 states. [2019-11-26 02:26:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:56,185 INFO L93 Difference]: Finished difference Result 600 states and 952 transitions. [2019-11-26 02:26:56,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:26:56,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-11-26 02:26:56,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:56,188 INFO L225 Difference]: With dead ends: 600 [2019-11-26 02:26:56,188 INFO L226 Difference]: Without dead ends: 334 [2019-11-26 02:26:56,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:26:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-11-26 02:26:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 283. [2019-11-26 02:26:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-26 02:26:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 454 transitions. [2019-11-26 02:26:56,200 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 454 transitions. Word has length 102 [2019-11-26 02:26:56,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:56,200 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 454 transitions. [2019-11-26 02:26:56,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:26:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 454 transitions. [2019-11-26 02:26:56,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-26 02:26:56,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:56,202 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-26 02:26:56,202 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:56,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:56,202 INFO L82 PathProgramCache]: Analyzing trace with hash -144902816, now seen corresponding path program 1 times [2019-11-26 02:26:56,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:56,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456416030] [2019-11-26 02:26:56,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:26:56,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456416030] [2019-11-26 02:26:56,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:56,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:26:56,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370501245] [2019-11-26 02:26:56,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:26:56,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:56,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:26:56,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:26:56,305 INFO L87 Difference]: Start difference. First operand 283 states and 454 transitions. Second operand 6 states. [2019-11-26 02:26:56,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:56,852 INFO L93 Difference]: Finished difference Result 603 states and 958 transitions. [2019-11-26 02:26:56,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:26:56,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-11-26 02:26:56,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:56,855 INFO L225 Difference]: With dead ends: 603 [2019-11-26 02:26:56,855 INFO L226 Difference]: Without dead ends: 332 [2019-11-26 02:26:56,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:26:56,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-26 02:26:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 284. [2019-11-26 02:26:56,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-26 02:26:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 455 transitions. [2019-11-26 02:26:56,868 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 455 transitions. Word has length 103 [2019-11-26 02:26:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:56,869 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 455 transitions. [2019-11-26 02:26:56,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:26:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 455 transitions. [2019-11-26 02:26:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-26 02:26:56,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:56,871 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:26:56,871 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:56,871 INFO L82 PathProgramCache]: Analyzing trace with hash -642019040, now seen corresponding path program 1 times [2019-11-26 02:26:56,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:56,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998926808] [2019-11-26 02:26:56,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:26:56,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998926808] [2019-11-26 02:26:56,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:56,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:26:56,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144315596] [2019-11-26 02:26:56,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:26:56,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:56,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:26:56,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:26:56,985 INFO L87 Difference]: Start difference. First operand 284 states and 455 transitions. Second operand 6 states. [2019-11-26 02:26:57,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:57,532 INFO L93 Difference]: Finished difference Result 599 states and 951 transitions. [2019-11-26 02:26:57,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:26:57,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2019-11-26 02:26:57,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:57,534 INFO L225 Difference]: With dead ends: 599 [2019-11-26 02:26:57,535 INFO L226 Difference]: Without dead ends: 327 [2019-11-26 02:26:57,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:26:57,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-11-26 02:26:57,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 287. [2019-11-26 02:26:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-26 02:26:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 458 transitions. [2019-11-26 02:26:57,548 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 458 transitions. Word has length 108 [2019-11-26 02:26:57,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:57,548 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 458 transitions. [2019-11-26 02:26:57,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:26:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 458 transitions. [2019-11-26 02:26:57,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-26 02:26:57,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:57,550 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-11-26 02:26:57,550 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:57,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:57,551 INFO L82 PathProgramCache]: Analyzing trace with hash -448127904, now seen corresponding path program 1 times [2019-11-26 02:26:57,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:57,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293783338] [2019-11-26 02:26:57,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-26 02:26:57,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293783338] [2019-11-26 02:26:57,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:57,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:57,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226659303] [2019-11-26 02:26:57,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:57,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:57,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:57,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:57,663 INFO L87 Difference]: Start difference. First operand 287 states and 458 transitions. Second operand 4 states. [2019-11-26 02:26:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:58,066 INFO L93 Difference]: Finished difference Result 598 states and 948 transitions. [2019-11-26 02:26:58,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:58,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-26 02:26:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:58,069 INFO L225 Difference]: With dead ends: 598 [2019-11-26 02:26:58,069 INFO L226 Difference]: Without dead ends: 323 [2019-11-26 02:26:58,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-26 02:26:58,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 287. [2019-11-26 02:26:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-26 02:26:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 457 transitions. [2019-11-26 02:26:58,081 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 457 transitions. Word has length 109 [2019-11-26 02:26:58,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:58,081 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 457 transitions. [2019-11-26 02:26:58,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 457 transitions. [2019-11-26 02:26:58,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-26 02:26:58,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:58,083 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2019-11-26 02:26:58,083 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:58,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:58,083 INFO L82 PathProgramCache]: Analyzing trace with hash 734181302, now seen corresponding path program 1 times [2019-11-26 02:26:58,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:58,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19572970] [2019-11-26 02:26:58,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:58,148 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:26:58,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19572970] [2019-11-26 02:26:58,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:58,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:58,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835900089] [2019-11-26 02:26:58,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:58,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:58,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:58,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:58,150 INFO L87 Difference]: Start difference. First operand 287 states and 457 transitions. Second operand 4 states. [2019-11-26 02:26:58,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:58,580 INFO L93 Difference]: Finished difference Result 644 states and 1025 transitions. [2019-11-26 02:26:58,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:58,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-26 02:26:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:58,583 INFO L225 Difference]: With dead ends: 644 [2019-11-26 02:26:58,584 INFO L226 Difference]: Without dead ends: 369 [2019-11-26 02:26:58,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:58,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-26 02:26:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 317. [2019-11-26 02:26:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-26 02:26:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 510 transitions. [2019-11-26 02:26:58,596 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 510 transitions. Word has length 109 [2019-11-26 02:26:58,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:58,597 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 510 transitions. [2019-11-26 02:26:58,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 510 transitions. [2019-11-26 02:26:58,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-26 02:26:58,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:58,598 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-26 02:26:58,599 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:58,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:58,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1598665232, now seen corresponding path program 1 times [2019-11-26 02:26:58,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:58,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923873363] [2019-11-26 02:26:58,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:26:58,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923873363] [2019-11-26 02:26:58,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:58,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:26:58,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067726820] [2019-11-26 02:26:58,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:26:58,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:58,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:26:58,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:58,703 INFO L87 Difference]: Start difference. First operand 317 states and 510 transitions. Second operand 5 states. [2019-11-26 02:26:59,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:59,090 INFO L93 Difference]: Finished difference Result 757 states and 1222 transitions. [2019-11-26 02:26:59,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:59,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-11-26 02:26:59,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:59,093 INFO L225 Difference]: With dead ends: 757 [2019-11-26 02:26:59,093 INFO L226 Difference]: Without dead ends: 452 [2019-11-26 02:26:59,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:26:59,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-26 02:26:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 347. [2019-11-26 02:26:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-26 02:26:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 563 transitions. [2019-11-26 02:26:59,107 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 563 transitions. Word has length 109 [2019-11-26 02:26:59,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:59,108 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 563 transitions. [2019-11-26 02:26:59,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:26:59,108 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 563 transitions. [2019-11-26 02:26:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-26 02:26:59,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:59,110 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2019-11-26 02:26:59,110 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:59,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:59,110 INFO L82 PathProgramCache]: Analyzing trace with hash -546321585, now seen corresponding path program 1 times [2019-11-26 02:26:59,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:59,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456651169] [2019-11-26 02:26:59,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-26 02:26:59,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456651169] [2019-11-26 02:26:59,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:59,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:59,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438195997] [2019-11-26 02:26:59,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:59,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:59,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:59,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:59,181 INFO L87 Difference]: Start difference. First operand 347 states and 563 transitions. Second operand 4 states. [2019-11-26 02:26:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:26:59,559 INFO L93 Difference]: Finished difference Result 716 states and 1156 transitions. [2019-11-26 02:26:59,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:26:59,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-26 02:26:59,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:26:59,561 INFO L225 Difference]: With dead ends: 716 [2019-11-26 02:26:59,562 INFO L226 Difference]: Without dead ends: 381 [2019-11-26 02:26:59,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:26:59,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-26 02:26:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 347. [2019-11-26 02:26:59,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-26 02:26:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 562 transitions. [2019-11-26 02:26:59,575 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 562 transitions. Word has length 110 [2019-11-26 02:26:59,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:26:59,576 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 562 transitions. [2019-11-26 02:26:59,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:26:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 562 transitions. [2019-11-26 02:26:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-26 02:26:59,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:26:59,577 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-26 02:26:59,577 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:26:59,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:26:59,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1849367339, now seen corresponding path program 1 times [2019-11-26 02:26:59,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:26:59,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804922394] [2019-11-26 02:26:59,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:26:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:26:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:26:59,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804922394] [2019-11-26 02:26:59,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:26:59,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:26:59,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163850656] [2019-11-26 02:26:59,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:26:59,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:26:59,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:26:59,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:26:59,641 INFO L87 Difference]: Start difference. First operand 347 states and 562 transitions. Second operand 4 states. [2019-11-26 02:27:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:27:00,023 INFO L93 Difference]: Finished difference Result 764 states and 1234 transitions. [2019-11-26 02:27:00,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:27:00,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-26 02:27:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:27:00,025 INFO L225 Difference]: With dead ends: 764 [2019-11-26 02:27:00,026 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:27:00,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:27:00,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:27:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 382. [2019-11-26 02:27:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-26 02:27:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 624 transitions. [2019-11-26 02:27:00,040 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 624 transitions. Word has length 114 [2019-11-26 02:27:00,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:27:00,040 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 624 transitions. [2019-11-26 02:27:00,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:27:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 624 transitions. [2019-11-26 02:27:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-26 02:27:00,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:27:00,042 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-26 02:27:00,042 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:27:00,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:27:00,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1930320177, now seen corresponding path program 1 times [2019-11-26 02:27:00,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:27:00,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240228087] [2019-11-26 02:27:00,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:27:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:27:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:27:00,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240228087] [2019-11-26 02:27:00,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:27:00,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:27:00,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026447449] [2019-11-26 02:27:00,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:27:00,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:27:00,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:27:00,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:27:00,134 INFO L87 Difference]: Start difference. First operand 382 states and 624 transitions. Second operand 5 states. [2019-11-26 02:27:00,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:27:00,603 INFO L93 Difference]: Finished difference Result 853 states and 1385 transitions. [2019-11-26 02:27:00,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:27:00,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-11-26 02:27:00,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:27:00,606 INFO L225 Difference]: With dead ends: 853 [2019-11-26 02:27:00,606 INFO L226 Difference]: Without dead ends: 483 [2019-11-26 02:27:00,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:27:00,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-26 02:27:00,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 382. [2019-11-26 02:27:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-26 02:27:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 623 transitions. [2019-11-26 02:27:00,626 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 623 transitions. Word has length 114 [2019-11-26 02:27:00,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:27:00,626 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 623 transitions. [2019-11-26 02:27:00,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:27:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 623 transitions. [2019-11-26 02:27:00,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-26 02:27:00,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:27:00,628 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2019-11-26 02:27:00,628 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:27:00,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:27:00,629 INFO L82 PathProgramCache]: Analyzing trace with hash -353290263, now seen corresponding path program 1 times [2019-11-26 02:27:00,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:27:00,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761627701] [2019-11-26 02:27:00,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:27:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:27:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:27:00,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761627701] [2019-11-26 02:27:00,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:27:00,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:27:00,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915848627] [2019-11-26 02:27:00,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:27:00,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:27:00,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:27:00,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:27:00,730 INFO L87 Difference]: Start difference. First operand 382 states and 623 transitions. Second operand 4 states. [2019-11-26 02:27:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:27:01,175 INFO L93 Difference]: Finished difference Result 832 states and 1353 transitions. [2019-11-26 02:27:01,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:27:01,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-26 02:27:01,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:27:01,178 INFO L225 Difference]: With dead ends: 832 [2019-11-26 02:27:01,178 INFO L226 Difference]: Without dead ends: 462 [2019-11-26 02:27:01,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:27:01,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-11-26 02:27:01,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 418. [2019-11-26 02:27:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-26 02:27:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 686 transitions. [2019-11-26 02:27:01,194 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 686 transitions. Word has length 115 [2019-11-26 02:27:01,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:27:01,194 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 686 transitions. [2019-11-26 02:27:01,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:27:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 686 transitions. [2019-11-26 02:27:01,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-26 02:27:01,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:27:01,196 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-26 02:27:01,196 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:27:01,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:27:01,197 INFO L82 PathProgramCache]: Analyzing trace with hash -2138719581, now seen corresponding path program 1 times [2019-11-26 02:27:01,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:27:01,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880598993] [2019-11-26 02:27:01,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:27:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:27:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:27:01,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880598993] [2019-11-26 02:27:01,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:27:01,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:27:01,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168024894] [2019-11-26 02:27:01,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:27:01,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:27:01,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:27:01,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:27:01,295 INFO L87 Difference]: Start difference. First operand 418 states and 686 transitions. Second operand 5 states. [2019-11-26 02:27:01,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:27:01,737 INFO L93 Difference]: Finished difference Result 887 states and 1442 transitions. [2019-11-26 02:27:01,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:27:01,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-11-26 02:27:01,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:27:01,741 INFO L225 Difference]: With dead ends: 887 [2019-11-26 02:27:01,741 INFO L226 Difference]: Without dead ends: 481 [2019-11-26 02:27:01,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:27:01,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-11-26 02:27:01,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 382. [2019-11-26 02:27:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-26 02:27:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 621 transitions. [2019-11-26 02:27:01,756 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 621 transitions. Word has length 115 [2019-11-26 02:27:01,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:27:01,757 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 621 transitions. [2019-11-26 02:27:01,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:27:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 621 transitions. [2019-11-26 02:27:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-26 02:27:01,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:27:01,758 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-26 02:27:01,758 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:27:01,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:27:01,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1941406665, now seen corresponding path program 1 times [2019-11-26 02:27:01,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:27:01,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915623260] [2019-11-26 02:27:01,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:27:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:27:01,826 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:27:01,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915623260] [2019-11-26 02:27:01,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:27:01,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:27:01,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693512903] [2019-11-26 02:27:01,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:27:01,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:27:01,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:27:01,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:27:01,828 INFO L87 Difference]: Start difference. First operand 382 states and 621 transitions. Second operand 4 states. [2019-11-26 02:27:02,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:27:02,290 INFO L93 Difference]: Finished difference Result 832 states and 1348 transitions. [2019-11-26 02:27:02,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:27:02,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-26 02:27:02,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:27:02,293 INFO L225 Difference]: With dead ends: 832 [2019-11-26 02:27:02,293 INFO L226 Difference]: Without dead ends: 462 [2019-11-26 02:27:02,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:27:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-11-26 02:27:02,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 423. [2019-11-26 02:27:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-11-26 02:27:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 691 transitions. [2019-11-26 02:27:02,310 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 691 transitions. Word has length 120 [2019-11-26 02:27:02,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:27:02,311 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 691 transitions. [2019-11-26 02:27:02,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:27:02,311 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 691 transitions. [2019-11-26 02:27:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-26 02:27:02,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:27:02,312 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-26 02:27:02,313 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:27:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:27:02,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1721408957, now seen corresponding path program 1 times [2019-11-26 02:27:02,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:27:02,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357604260] [2019-11-26 02:27:02,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:27:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:27:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:27:02,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357604260] [2019-11-26 02:27:02,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:27:02,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:27:02,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633663608] [2019-11-26 02:27:02,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:27:02,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:27:02,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:27:02,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:27:02,403 INFO L87 Difference]: Start difference. First operand 423 states and 691 transitions. Second operand 5 states. [2019-11-26 02:27:02,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:27:02,886 INFO L93 Difference]: Finished difference Result 935 states and 1517 transitions. [2019-11-26 02:27:02,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:27:02,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-11-26 02:27:02,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:27:02,891 INFO L225 Difference]: With dead ends: 935 [2019-11-26 02:27:02,891 INFO L226 Difference]: Without dead ends: 524 [2019-11-26 02:27:02,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:27:02,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-11-26 02:27:02,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 423. [2019-11-26 02:27:02,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-11-26 02:27:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 691 transitions. [2019-11-26 02:27:02,908 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 691 transitions. Word has length 120 [2019-11-26 02:27:02,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:27:02,908 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 691 transitions. [2019-11-26 02:27:02,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:27:02,909 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 691 transitions. [2019-11-26 02:27:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-26 02:27:02,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:27:02,910 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 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] [2019-11-26 02:27:02,910 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:27:02,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:27:02,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2074438615, now seen corresponding path program 1 times [2019-11-26 02:27:02,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:27:02,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418358074] [2019-11-26 02:27:02,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:27:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:27:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-26 02:27:02,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418358074] [2019-11-26 02:27:02,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:27:02,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:27:02,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849457073] [2019-11-26 02:27:02,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:27:02,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:27:02,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:27:02,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:27:02,966 INFO L87 Difference]: Start difference. First operand 423 states and 691 transitions. Second operand 4 states. [2019-11-26 02:27:03,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:27:03,421 INFO L93 Difference]: Finished difference Result 914 states and 1487 transitions. [2019-11-26 02:27:03,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:27:03,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-26 02:27:03,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:27:03,424 INFO L225 Difference]: With dead ends: 914 [2019-11-26 02:27:03,424 INFO L226 Difference]: Without dead ends: 503 [2019-11-26 02:27:03,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:27:03,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-11-26 02:27:03,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 437. [2019-11-26 02:27:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-11-26 02:27:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 712 transitions. [2019-11-26 02:27:03,442 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 712 transitions. Word has length 121 [2019-11-26 02:27:03,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:27:03,442 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 712 transitions. [2019-11-26 02:27:03,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:27:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 712 transitions. [2019-11-26 02:27:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-26 02:27:03,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:27:03,444 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-26 02:27:03,444 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:27:03,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:27:03,445 INFO L82 PathProgramCache]: Analyzing trace with hash 2140351637, now seen corresponding path program 1 times [2019-11-26 02:27:03,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:27:03,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059358216] [2019-11-26 02:27:03,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:27:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:27:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:27:03,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059358216] [2019-11-26 02:27:03,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:27:03,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:27:03,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779545074] [2019-11-26 02:27:03,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:27:03,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:27:03,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:27:03,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:27:03,509 INFO L87 Difference]: Start difference. First operand 437 states and 712 transitions. Second operand 4 states. [2019-11-26 02:27:03,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:27:03,906 INFO L93 Difference]: Finished difference Result 926 states and 1505 transitions. [2019-11-26 02:27:03,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:27:03,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-26 02:27:03,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:27:03,909 INFO L225 Difference]: With dead ends: 926 [2019-11-26 02:27:03,909 INFO L226 Difference]: Without dead ends: 499 [2019-11-26 02:27:03,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:27:03,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-11-26 02:27:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 463. [2019-11-26 02:27:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-11-26 02:27:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 758 transitions. [2019-11-26 02:27:03,929 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 758 transitions. Word has length 121 [2019-11-26 02:27:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:27:03,929 INFO L462 AbstractCegarLoop]: Abstraction has 463 states and 758 transitions. [2019-11-26 02:27:03,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:27:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 758 transitions. [2019-11-26 02:27:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-26 02:27:03,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:27:03,931 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2019-11-26 02:27:03,931 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:27:03,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:27:03,932 INFO L82 PathProgramCache]: Analyzing trace with hash -196304029, now seen corresponding path program 1 times [2019-11-26 02:27:03,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:27:03,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125292656] [2019-11-26 02:27:03,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:27:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:27:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 100 proven. 17 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-26 02:27:04,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125292656] [2019-11-26 02:27:04,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777940444] [2019-11-26 02:27:04,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/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-11-26 02:27:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:27:04,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:27:04,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:27:04,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-26 02:27:04,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:27:04,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:27:04,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:27:04,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-26 02:27:04,368 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_315|, |v_#memory_$Pointer$.offset_315|], 5=[|v_#memory_int_317|]} [2019-11-26 02:27:04,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2019-11-26 02:27:04,372 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:27:04,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:27:04,381 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2019-11-26 02:27:04,382 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:27:04,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:27:04,431 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:27:04,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-11-26 02:27:04,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:27:04,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:27:04,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:27:04,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:27:04,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:27:04,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:27:04,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:27:04,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:27:04,686 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-26 02:27:04,690 INFO L168 Benchmark]: Toolchain (without parser) took 24146.29 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 514.9 MB). Free memory was 940.7 MB in the beginning and 1.4 GB in the end (delta: -447.3 MB). Peak memory consumption was 67.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:27:04,690 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:27:04,690 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:27:04,691 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:27:04,691 INFO L168 Benchmark]: Boogie Preprocessor took 132.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:27:04,691 INFO L168 Benchmark]: RCFGBuilder took 1750.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.0 MB in the end (delta: 184.5 MB). Peak memory consumption was 184.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:27:04,692 INFO L168 Benchmark]: TraceAbstraction took 21432.29 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 380.1 MB). Free memory was 911.0 MB in the beginning and 1.4 GB in the end (delta: -477.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:27:04,693 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 756.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 132.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1750.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.0 MB in the end (delta: 184.5 MB). Peak memory consumption was 184.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21432.29 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 380.1 MB). Free memory was 911.0 MB in the beginning and 1.4 GB in the end (delta: -477.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:27:06,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:27:06,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:27:06,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:27:06,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:27:06,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:27:06,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:27:06,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:27:06,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:27:06,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:27:06,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:27:06,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:27:06,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:27:06,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:27:06,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:27:06,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:27:06,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:27:06,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:27:06,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:27:06,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:27:06,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:27:06,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:27:06,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:27:06,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:27:06,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:27:06,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:27:06,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:27:06,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:27:06,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:27:06,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:27:06,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:27:06,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:27:06,642 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:27:06,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:27:06,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:27:06,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:27:06,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:27:06,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:27:06,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:27:06,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:27:06,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:27:06,647 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-11-26 02:27:06,661 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:27:06,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:27:06,662 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:27:06,662 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:27:06,662 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:27:06,663 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:27:06,663 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:27:06,663 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:27:06,663 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:27:06,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:27:06,664 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:27:06,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:27:06,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:27:06,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:27:06,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:27:06,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:27:06,666 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:27:06,666 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:27:06,666 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:27:06,666 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:27:06,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:27:06,667 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:27:06,667 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:27:06,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:27:06,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:27:06,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:27:06,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:27:06,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:27:06,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:27:06,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:27:06,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:27:06,669 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:27:06,670 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:27:06,670 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:27:06,670 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:27:06,670 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/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 -> 8ae4fea535defe079744031ef9589bd179b2820b [2019-11-26 02:27:06,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:27:06,927 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:27:06,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:27:06,931 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:27:06,931 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:27:06,932 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c [2019-11-26 02:27:06,990 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/data/a73741dea/bbdde4b9877e42bbbeb2b3a913217b9f/FLAG28dc7e38a [2019-11-26 02:27:07,564 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:27:07,564 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c [2019-11-26 02:27:07,590 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/data/a73741dea/bbdde4b9877e42bbbeb2b3a913217b9f/FLAG28dc7e38a [2019-11-26 02:27:07,811 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d3795d32-e76f-4b81-9125-6f5e64022a73/bin/utaipan/data/a73741dea/bbdde4b9877e42bbbeb2b3a913217b9f [2019-11-26 02:27:07,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:27:07,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:27:07,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:27:07,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:27:07,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:27:07,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:27:07" (1/1) ... [2019-11-26 02:27:07,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@541c1e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:27:07, skipping insertion in model container [2019-11-26 02:27:07,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:27:07" (1/1) ... [2019-11-26 02:27:07,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:27:07,899 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:27:08,298 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-26 02:27:08,299 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-26 02:27:08,299 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:27:08,320 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: Unsupported type(() : VOID) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructBytesizeExpression(TypeSizeAndOffsetComputer.java:121) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:955) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:700) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1300) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3448) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2263) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:573) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-26 02:27:08,339 INFO L168 Benchmark]: Toolchain (without parser) took 523.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -201.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:27:08,339 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:27:08,340 INFO L168 Benchmark]: CACSL2BoogieTranslator took 521.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -201.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:27:08,342 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 521.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -201.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: Unsupported type(() : VOID): de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...