./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.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_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/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 1952eae46575e60399f761afaedbe356b8f81a96 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/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 1952eae46575e60399f761afaedbe356b8f81a96 .................................................................................................................................................................. 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:21:09,482 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:21:09,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:21:09,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:21:09,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:21:09,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:21:09,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:21:09,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:21:09,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:21:09,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:21:09,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:21:09,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:21:09,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:21:09,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:21:09,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:21:09,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:21:09,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:21:09,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:21:09,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:21:09,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:21:09,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:21:09,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:21:09,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:21:09,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:21:09,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:21:09,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:21:09,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:21:09,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:21:09,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:21:09,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:21:09,568 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:21:09,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:21:09,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:21:09,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:21:09,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:21:09,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:21:09,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:21:09,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:21:09,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:21:09,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:21:09,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:21:09,576 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:21:09,607 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:21:09,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:21:09,620 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:21:09,620 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:21:09,621 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:21:09,621 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:21:09,621 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:21:09,621 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:21:09,622 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:21:09,622 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:21:09,622 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:21:09,622 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:21:09,623 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:21:09,623 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:21:09,623 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:21:09,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:21:09,624 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:21:09,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:21:09,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:21:09,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:21:09,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:21:09,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:21:09,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:21:09,626 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:21:09,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:21:09,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:21:09,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:21:09,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:21:09,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:21:09,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:21:09,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:21:09,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:21:09,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:21:09,629 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:21:09,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:21:09,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:21:09,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:21:09,631 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_89e44c70-abba-43a0-8ff6-8407ce682619/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 -> 1952eae46575e60399f761afaedbe356b8f81a96 [2019-11-26 02:21:09,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:21:09,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:21:09,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:21:09,860 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:21:09,861 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:21:09,862 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-11-26 02:21:09,934 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/data/25a5a3aab/a4eee4622a3b4adca5b2baab5eb9f9a7/FLAG498929f7f [2019-11-26 02:21:10,552 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:21:10,553 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-11-26 02:21:10,602 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/data/25a5a3aab/a4eee4622a3b4adca5b2baab5eb9f9a7/FLAG498929f7f [2019-11-26 02:21:10,743 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/data/25a5a3aab/a4eee4622a3b4adca5b2baab5eb9f9a7 [2019-11-26 02:21:10,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:21:10,747 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:21:10,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:21:10,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:21:10,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:21:10,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:21:10" (1/1) ... [2019-11-26 02:21:10,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7744e8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:10, skipping insertion in model container [2019-11-26 02:21:10,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:21:10" (1/1) ... [2019-11-26 02:21:10,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:21:10,856 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:21:11,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:21:11,527 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:21:11,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:21:11,687 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:21:11,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:11 WrapperNode [2019-11-26 02:21:11,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:21:11,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:21:11,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:21:11,690 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:21:11,699 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:21:11" (1/1) ... [2019-11-26 02:21:11,742 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:21:11" (1/1) ... [2019-11-26 02:21:11,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:21:11,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:21:11,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:21:11,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:21:11,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:11" (1/1) ... [2019-11-26 02:21:11,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:11" (1/1) ... [2019-11-26 02:21:11,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:11" (1/1) ... [2019-11-26 02:21:11,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:11" (1/1) ... [2019-11-26 02:21:11,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:11" (1/1) ... [2019-11-26 02:21:11,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:11" (1/1) ... [2019-11-26 02:21:11,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:11" (1/1) ... [2019-11-26 02:21:11,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:21:11,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:21:11,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:21:11,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:21:11,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/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:21:12,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 02:21:12,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:21:12,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:21:12,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 02:21:12,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 02:21:12,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:21:12,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:21:12,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:21:12,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:21:12,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:21:12,397 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:21:13,501 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-26 02:21:13,502 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-26 02:21:14,372 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:21:14,373 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:21:14,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:21:14 BoogieIcfgContainer [2019-11-26 02:21:14,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:21:14,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:21:14,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:21:14,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:21:14,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:21:10" (1/3) ... [2019-11-26 02:21:14,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ee1385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:21:14, skipping insertion in model container [2019-11-26 02:21:14,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:11" (2/3) ... [2019-11-26 02:21:14,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ee1385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:21:14, skipping insertion in model container [2019-11-26 02:21:14,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:21:14" (3/3) ... [2019-11-26 02:21:14,383 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2019-11-26 02:21:14,392 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:21:14,398 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:21:14,409 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:21:14,430 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:21:14,430 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:21:14,430 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:21:14,430 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:21:14,430 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:21:14,430 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:21:14,431 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:21:14,431 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:21:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-26 02:21:14,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-26 02:21:14,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:14,452 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:21:14,452 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:14,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:14,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1199777793, now seen corresponding path program 1 times [2019-11-26 02:21:14,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:14,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828123097] [2019-11-26 02:21:14,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:14,740 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:21:14,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828123097] [2019-11-26 02:21:14,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:14,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:21:14,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013932516] [2019-11-26 02:21:14,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:14,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:14,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:14,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:14,760 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 4 states. [2019-11-26 02:21:15,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:15,240 INFO L93 Difference]: Finished difference Result 239 states and 412 transitions. [2019-11-26 02:21:15,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:15,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-26 02:21:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:15,250 INFO L225 Difference]: With dead ends: 239 [2019-11-26 02:21:15,251 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:21:15,254 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:21:15,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:21:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:21:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:21:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 175 transitions. [2019-11-26 02:21:15,294 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 175 transitions. Word has length 39 [2019-11-26 02:21:15,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:15,294 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 175 transitions. [2019-11-26 02:21:15,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:15,294 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 175 transitions. [2019-11-26 02:21:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-26 02:21:15,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:15,297 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, 1, 1, 1] [2019-11-26 02:21:15,297 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:15,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:15,298 INFO L82 PathProgramCache]: Analyzing trace with hash 515544956, now seen corresponding path program 1 times [2019-11-26 02:21:15,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:15,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853341788] [2019-11-26 02:21:15,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:15,462 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:21:15,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853341788] [2019-11-26 02:21:15,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:15,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:21:15,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916943071] [2019-11-26 02:21:15,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:15,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:15,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:15,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:15,465 INFO L87 Difference]: Start difference. First operand 115 states and 175 transitions. Second operand 4 states. [2019-11-26 02:21:15,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:15,937 INFO L93 Difference]: Finished difference Result 230 states and 344 transitions. [2019-11-26 02:21:15,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:15,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-26 02:21:15,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:15,940 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:21:15,941 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:21:15,942 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:21:15,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:21:15,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:21:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:21:15,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 174 transitions. [2019-11-26 02:21:15,955 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 174 transitions. Word has length 49 [2019-11-26 02:21:15,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:15,955 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 174 transitions. [2019-11-26 02:21:15,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:15,956 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 174 transitions. [2019-11-26 02:21:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 02:21:15,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:15,959 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:21:15,959 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:15,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:15,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1633025912, now seen corresponding path program 1 times [2019-11-26 02:21:15,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:15,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255883102] [2019-11-26 02:21:15,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:16,052 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:21:16,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255883102] [2019-11-26 02:21:16,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:16,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:21:16,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52858353] [2019-11-26 02:21:16,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:16,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:16,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:16,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:16,064 INFO L87 Difference]: Start difference. First operand 115 states and 174 transitions. Second operand 4 states. [2019-11-26 02:21:16,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:16,468 INFO L93 Difference]: Finished difference Result 230 states and 343 transitions. [2019-11-26 02:21:16,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:16,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-26 02:21:16,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:16,471 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:21:16,471 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:21:16,472 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:21:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:21:16,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:21:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:21:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 173 transitions. [2019-11-26 02:21:16,488 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 173 transitions. Word has length 50 [2019-11-26 02:21:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:16,489 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 173 transitions. [2019-11-26 02:21:16,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 173 transitions. [2019-11-26 02:21:16,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 02:21:16,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:16,491 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, 1, 1, 1] [2019-11-26 02:21:16,492 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:16,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:16,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1927691189, now seen corresponding path program 1 times [2019-11-26 02:21:16,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:16,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175846734] [2019-11-26 02:21:16,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:16,644 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:21:16,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175846734] [2019-11-26 02:21:16,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:16,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:21:16,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146684037] [2019-11-26 02:21:16,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:16,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:16,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:16,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:16,646 INFO L87 Difference]: Start difference. First operand 115 states and 173 transitions. Second operand 4 states. [2019-11-26 02:21:17,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:17,013 INFO L93 Difference]: Finished difference Result 230 states and 342 transitions. [2019-11-26 02:21:17,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:17,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-26 02:21:17,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:17,018 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:21:17,018 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:21:17,019 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:21:17,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:21:17,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:21:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:21:17,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-11-26 02:21:17,028 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 51 [2019-11-26 02:21:17,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:17,029 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-11-26 02:21:17,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-11-26 02:21:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 02:21:17,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:17,035 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:21:17,035 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:17,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:17,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1940571797, now seen corresponding path program 1 times [2019-11-26 02:21:17,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:17,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027484320] [2019-11-26 02:21:17,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:17,102 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:21:17,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027484320] [2019-11-26 02:21:17,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:17,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:21:17,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144559389] [2019-11-26 02:21:17,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:17,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:17,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:17,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:17,104 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 4 states. [2019-11-26 02:21:17,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:17,416 INFO L93 Difference]: Finished difference Result 230 states and 341 transitions. [2019-11-26 02:21:17,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:17,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-26 02:21:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:17,418 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:21:17,418 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:21:17,419 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:21:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:21:17,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:21:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:21:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2019-11-26 02:21:17,427 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 51 [2019-11-26 02:21:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:17,427 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2019-11-26 02:21:17,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2019-11-26 02:21:17,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 02:21:17,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:17,429 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:21:17,429 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:17,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:17,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1263374362, now seen corresponding path program 1 times [2019-11-26 02:21:17,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:17,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853111463] [2019-11-26 02:21:17,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:17,480 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:21:17,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853111463] [2019-11-26 02:21:17,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:17,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:21:17,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340523910] [2019-11-26 02:21:17,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:17,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:17,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:17,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:17,482 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand 4 states. [2019-11-26 02:21:17,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:17,820 INFO L93 Difference]: Finished difference Result 230 states and 340 transitions. [2019-11-26 02:21:17,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:17,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-26 02:21:17,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:17,823 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:21:17,823 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:21:17,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:21:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:21:17,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:21:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:21:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 170 transitions. [2019-11-26 02:21:17,831 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 170 transitions. Word has length 51 [2019-11-26 02:21:17,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:17,832 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 170 transitions. [2019-11-26 02:21:17,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 170 transitions. [2019-11-26 02:21:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-26 02:21:17,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:17,833 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, 1, 1, 1] [2019-11-26 02:21:17,834 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:17,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:17,834 INFO L82 PathProgramCache]: Analyzing trace with hash 200817923, now seen corresponding path program 1 times [2019-11-26 02:21:17,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:17,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680986528] [2019-11-26 02:21:17,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:17,909 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:21:17,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680986528] [2019-11-26 02:21:17,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:17,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:21:17,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774842537] [2019-11-26 02:21:17,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:17,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:17,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:17,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:17,911 INFO L87 Difference]: Start difference. First operand 115 states and 170 transitions. Second operand 4 states. [2019-11-26 02:21:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:18,173 INFO L93 Difference]: Finished difference Result 230 states and 339 transitions. [2019-11-26 02:21:18,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:18,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-26 02:21:18,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:18,175 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:21:18,176 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:21:18,176 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:21:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:21:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:21:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:21:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2019-11-26 02:21:18,182 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 52 [2019-11-26 02:21:18,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:18,182 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2019-11-26 02:21:18,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2019-11-26 02:21:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-26 02:21:18,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:18,183 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, 1, 1, 1] [2019-11-26 02:21:18,184 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:18,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:18,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1497151304, now seen corresponding path program 1 times [2019-11-26 02:21:18,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:18,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542632691] [2019-11-26 02:21:18,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:18,234 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:21:18,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542632691] [2019-11-26 02:21:18,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:18,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:21:18,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289696887] [2019-11-26 02:21:18,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:18,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:18,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:18,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:18,236 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand 4 states. [2019-11-26 02:21:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:18,541 INFO L93 Difference]: Finished difference Result 228 states and 336 transitions. [2019-11-26 02:21:18,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:18,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-26 02:21:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:18,543 INFO L225 Difference]: With dead ends: 228 [2019-11-26 02:21:18,543 INFO L226 Difference]: Without dead ends: 125 [2019-11-26 02:21:18,544 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:21:18,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-26 02:21:18,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2019-11-26 02:21:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:21:18,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2019-11-26 02:21:18,550 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 52 [2019-11-26 02:21:18,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:18,551 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2019-11-26 02:21:18,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:18,551 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2019-11-26 02:21:18,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 02:21:18,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:18,552 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, 1, 1, 1] [2019-11-26 02:21:18,552 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:18,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:18,552 INFO L82 PathProgramCache]: Analyzing trace with hash 138321766, now seen corresponding path program 1 times [2019-11-26 02:21:18,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:18,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870160134] [2019-11-26 02:21:18,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:18,617 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:21:18,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870160134] [2019-11-26 02:21:18,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:18,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:21:18,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069387051] [2019-11-26 02:21:18,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:18,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:18,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:18,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:18,620 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand 4 states. [2019-11-26 02:21:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:18,885 INFO L93 Difference]: Finished difference Result 220 states and 325 transitions. [2019-11-26 02:21:18,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:18,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-26 02:21:18,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:18,887 INFO L225 Difference]: With dead ends: 220 [2019-11-26 02:21:18,887 INFO L226 Difference]: Without dead ends: 117 [2019-11-26 02:21:18,887 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:21:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-26 02:21:18,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-11-26 02:21:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:21:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2019-11-26 02:21:18,892 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 53 [2019-11-26 02:21:18,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:18,892 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2019-11-26 02:21:18,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2019-11-26 02:21:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-26 02:21:18,900 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:18,902 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, 1, 1, 1] [2019-11-26 02:21:18,903 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:18,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:18,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1875690079, now seen corresponding path program 1 times [2019-11-26 02:21:18,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:18,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115541610] [2019-11-26 02:21:18,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:18,956 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:21:18,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115541610] [2019-11-26 02:21:18,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:18,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:21:18,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55598877] [2019-11-26 02:21:18,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:18,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:18,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:18,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:18,958 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand 4 states. [2019-11-26 02:21:19,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:19,282 INFO L93 Difference]: Finished difference Result 252 states and 373 transitions. [2019-11-26 02:21:19,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:19,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-26 02:21:19,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:19,285 INFO L225 Difference]: With dead ends: 252 [2019-11-26 02:21:19,285 INFO L226 Difference]: Without dead ends: 149 [2019-11-26 02:21:19,285 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:21:19,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-26 02:21:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2019-11-26 02:21:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-26 02:21:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2019-11-26 02:21:19,290 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 54 [2019-11-26 02:21:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:19,290 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2019-11-26 02:21:19,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2019-11-26 02:21:19,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-26 02:21:19,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:19,291 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, 1, 1, 1] [2019-11-26 02:21:19,292 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:19,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:19,292 INFO L82 PathProgramCache]: Analyzing trace with hash 544279004, now seen corresponding path program 1 times [2019-11-26 02:21:19,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:19,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360424520] [2019-11-26 02:21:19,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:19,381 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:21:19,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360424520] [2019-11-26 02:21:19,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:19,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:21:19,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119988127] [2019-11-26 02:21:19,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:19,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:19,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:19,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:19,383 INFO L87 Difference]: Start difference. First operand 135 states and 201 transitions. Second operand 4 states. [2019-11-26 02:21:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:19,696 INFO L93 Difference]: Finished difference Result 272 states and 406 transitions. [2019-11-26 02:21:19,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:19,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-26 02:21:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:19,698 INFO L225 Difference]: With dead ends: 272 [2019-11-26 02:21:19,699 INFO L226 Difference]: Without dead ends: 149 [2019-11-26 02:21:19,699 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:21:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-26 02:21:19,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2019-11-26 02:21:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-26 02:21:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 200 transitions. [2019-11-26 02:21:19,705 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 200 transitions. Word has length 64 [2019-11-26 02:21:19,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:19,705 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 200 transitions. [2019-11-26 02:21:19,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 200 transitions. [2019-11-26 02:21:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-26 02:21:19,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:19,706 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, 1, 1] [2019-11-26 02:21:19,707 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:19,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:19,707 INFO L82 PathProgramCache]: Analyzing trace with hash -742270424, now seen corresponding path program 1 times [2019-11-26 02:21:19,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:19,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14868588] [2019-11-26 02:21:19,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:19,805 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:21:19,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14868588] [2019-11-26 02:21:19,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:19,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:21:19,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190411305] [2019-11-26 02:21:19,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:21:19,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:19,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:21:19,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:21:19,808 INFO L87 Difference]: Start difference. First operand 135 states and 200 transitions. Second operand 5 states. [2019-11-26 02:21:20,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:20,237 INFO L93 Difference]: Finished difference Result 275 states and 411 transitions. [2019-11-26 02:21:20,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:21:20,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-26 02:21:20,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:20,240 INFO L225 Difference]: With dead ends: 275 [2019-11-26 02:21:20,240 INFO L226 Difference]: Without dead ends: 152 [2019-11-26 02:21:20,240 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:21:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-26 02:21:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-11-26 02:21:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:21:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 220 transitions. [2019-11-26 02:21:20,248 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 220 transitions. Word has length 65 [2019-11-26 02:21:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:20,248 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 220 transitions. [2019-11-26 02:21:20,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:21:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2019-11-26 02:21:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-26 02:21:20,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:20,249 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, 1, 1, 1] [2019-11-26 02:21:20,250 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:20,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:20,250 INFO L82 PathProgramCache]: Analyzing trace with hash -96955445, now seen corresponding path program 1 times [2019-11-26 02:21:20,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:20,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440351716] [2019-11-26 02:21:20,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:20,316 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:21:20,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440351716] [2019-11-26 02:21:20,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:20,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:21:20,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088791525] [2019-11-26 02:21:20,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:20,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:20,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:20,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:20,318 INFO L87 Difference]: Start difference. First operand 151 states and 220 transitions. Second operand 4 states. [2019-11-26 02:21:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:20,725 INFO L93 Difference]: Finished difference Result 304 states and 443 transitions. [2019-11-26 02:21:20,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:20,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-26 02:21:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:20,728 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:21:20,728 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:21:20,728 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:21:20,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:21:20,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:21:20,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:21:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2019-11-26 02:21:20,734 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 66 [2019-11-26 02:21:20,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:20,734 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2019-11-26 02:21:20,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2019-11-26 02:21:20,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-26 02:21:20,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:20,735 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, 1, 1, 1] [2019-11-26 02:21:20,736 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:20,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:20,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1187976582, now seen corresponding path program 1 times [2019-11-26 02:21:20,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:20,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877635049] [2019-11-26 02:21:20,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:20,787 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:21:20,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877635049] [2019-11-26 02:21:20,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:20,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:21:20,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614140843] [2019-11-26 02:21:20,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:20,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:20,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:20,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:20,789 INFO L87 Difference]: Start difference. First operand 151 states and 219 transitions. Second operand 4 states. [2019-11-26 02:21:21,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:21,197 INFO L93 Difference]: Finished difference Result 304 states and 441 transitions. [2019-11-26 02:21:21,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:21,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-26 02:21:21,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:21,200 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:21:21,200 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:21:21,201 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:21:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:21:21,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:21:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:21:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 218 transitions. [2019-11-26 02:21:21,208 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 218 transitions. Word has length 66 [2019-11-26 02:21:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:21,208 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 218 transitions. [2019-11-26 02:21:21,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:21,208 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 218 transitions. [2019-11-26 02:21:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-26 02:21:21,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:21,209 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, 1, 1, 1] [2019-11-26 02:21:21,209 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:21,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:21,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1026309466, now seen corresponding path program 1 times [2019-11-26 02:21:21,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:21,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612862876] [2019-11-26 02:21:21,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:21,259 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:21:21,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612862876] [2019-11-26 02:21:21,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:21,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:21:21,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217394061] [2019-11-26 02:21:21,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:21,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:21,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:21,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:21,262 INFO L87 Difference]: Start difference. First operand 151 states and 218 transitions. Second operand 4 states. [2019-11-26 02:21:21,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:21,568 INFO L93 Difference]: Finished difference Result 304 states and 439 transitions. [2019-11-26 02:21:21,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:21,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-26 02:21:21,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:21,571 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:21:21,571 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:21:21,571 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:21:21,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:21:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:21:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:21:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 217 transitions. [2019-11-26 02:21:21,577 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 217 transitions. Word has length 66 [2019-11-26 02:21:21,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:21,577 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 217 transitions. [2019-11-26 02:21:21,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:21,577 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 217 transitions. [2019-11-26 02:21:21,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-26 02:21:21,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:21,578 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, 1, 1, 1] [2019-11-26 02:21:21,578 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:21,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:21,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2097082749, now seen corresponding path program 1 times [2019-11-26 02:21:21,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:21,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966346522] [2019-11-26 02:21:21,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:21,619 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:21:21,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966346522] [2019-11-26 02:21:21,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:21,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:21:21,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577290859] [2019-11-26 02:21:21,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:21,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:21,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:21,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:21,621 INFO L87 Difference]: Start difference. First operand 151 states and 217 transitions. Second operand 4 states. [2019-11-26 02:21:21,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:21,994 INFO L93 Difference]: Finished difference Result 304 states and 437 transitions. [2019-11-26 02:21:21,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:21,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-26 02:21:21,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:21,997 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:21:21,997 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:21:21,998 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:21:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:21:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:21:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:21:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 216 transitions. [2019-11-26 02:21:22,005 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 216 transitions. Word has length 67 [2019-11-26 02:21:22,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:22,005 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 216 transitions. [2019-11-26 02:21:22,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:22,006 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 216 transitions. [2019-11-26 02:21:22,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-26 02:21:22,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:22,007 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, 1, 1, 1] [2019-11-26 02:21:22,007 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:22,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:22,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1480283928, now seen corresponding path program 1 times [2019-11-26 02:21:22,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:22,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571094775] [2019-11-26 02:21:22,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:22,059 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:21:22,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571094775] [2019-11-26 02:21:22,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:22,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:21:22,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775995217] [2019-11-26 02:21:22,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:22,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:22,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:22,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:22,062 INFO L87 Difference]: Start difference. First operand 151 states and 216 transitions. Second operand 4 states. [2019-11-26 02:21:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:22,489 INFO L93 Difference]: Finished difference Result 302 states and 433 transitions. [2019-11-26 02:21:22,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:22,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-26 02:21:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:22,491 INFO L225 Difference]: With dead ends: 302 [2019-11-26 02:21:22,492 INFO L226 Difference]: Without dead ends: 163 [2019-11-26 02:21:22,492 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:21:22,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-26 02:21:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2019-11-26 02:21:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:21:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 215 transitions. [2019-11-26 02:21:22,499 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 215 transitions. Word has length 67 [2019-11-26 02:21:22,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:22,499 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 215 transitions. [2019-11-26 02:21:22,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:22,500 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 215 transitions. [2019-11-26 02:21:22,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-26 02:21:22,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:22,501 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, 1, 1, 1] [2019-11-26 02:21:22,501 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:22,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:22,501 INFO L82 PathProgramCache]: Analyzing trace with hash 333446539, now seen corresponding path program 1 times [2019-11-26 02:21:22,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:22,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612215536] [2019-11-26 02:21:22,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:22,547 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:21:22,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612215536] [2019-11-26 02:21:22,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:22,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:21:22,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483595338] [2019-11-26 02:21:22,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:22,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:22,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:22,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:22,549 INFO L87 Difference]: Start difference. First operand 151 states and 215 transitions. Second operand 4 states. [2019-11-26 02:21:22,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:22,921 INFO L93 Difference]: Finished difference Result 302 states and 431 transitions. [2019-11-26 02:21:22,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:22,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-26 02:21:22,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:22,924 INFO L225 Difference]: With dead ends: 302 [2019-11-26 02:21:22,924 INFO L226 Difference]: Without dead ends: 163 [2019-11-26 02:21:22,925 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:21:22,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-26 02:21:22,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2019-11-26 02:21:22,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:21:22,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 214 transitions. [2019-11-26 02:21:22,932 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 214 transitions. Word has length 68 [2019-11-26 02:21:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:22,933 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 214 transitions. [2019-11-26 02:21:22,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:22,933 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 214 transitions. [2019-11-26 02:21:22,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-26 02:21:22,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:22,934 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, 1, 1, 1] [2019-11-26 02:21:22,935 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:22,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:22,935 INFO L82 PathProgramCache]: Analyzing trace with hash -364794168, now seen corresponding path program 1 times [2019-11-26 02:21:22,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:22,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630914567] [2019-11-26 02:21:22,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:23,021 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:21:23,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630914567] [2019-11-26 02:21:23,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:23,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:21:23,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26571231] [2019-11-26 02:21:23,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:23,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:23,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:23,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:23,024 INFO L87 Difference]: Start difference. First operand 151 states and 214 transitions. Second operand 4 states. [2019-11-26 02:21:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:23,397 INFO L93 Difference]: Finished difference Result 294 states and 420 transitions. [2019-11-26 02:21:23,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:23,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-26 02:21:23,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:23,399 INFO L225 Difference]: With dead ends: 294 [2019-11-26 02:21:23,399 INFO L226 Difference]: Without dead ends: 155 [2019-11-26 02:21:23,400 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:21:23,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-26 02:21:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2019-11-26 02:21:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:21:23,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 213 transitions. [2019-11-26 02:21:23,405 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 213 transitions. Word has length 69 [2019-11-26 02:21:23,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:23,405 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 213 transitions. [2019-11-26 02:21:23,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:23,406 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 213 transitions. [2019-11-26 02:21:23,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-26 02:21:23,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:23,407 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, 1, 1] [2019-11-26 02:21:23,407 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:23,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:23,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1665999481, now seen corresponding path program 1 times [2019-11-26 02:21:23,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:23,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030665306] [2019-11-26 02:21:23,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:21:23,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030665306] [2019-11-26 02:21:23,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583716786] [2019-11-26 02:21:23,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/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:21:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:23,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:21:23,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:21:23,706 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:21:23,707 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:21:23,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:21:23,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:21:23,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:21:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-26 02:21:23,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-26 02:21:23,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4, 4] total 5 [2019-11-26 02:21:23,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306493996] [2019-11-26 02:21:23,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:21:23,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:23,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:21:23,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:21:23,750 INFO L87 Difference]: Start difference. First operand 151 states and 213 transitions. Second operand 3 states. [2019-11-26 02:21:23,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:23,775 INFO L93 Difference]: Finished difference Result 288 states and 412 transitions. [2019-11-26 02:21:23,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:21:23,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-26 02:21:23,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:23,777 INFO L225 Difference]: With dead ends: 288 [2019-11-26 02:21:23,777 INFO L226 Difference]: Without dead ends: 286 [2019-11-26 02:21:23,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:21:23,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-26 02:21:23,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2019-11-26 02:21:23,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-26 02:21:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 408 transitions. [2019-11-26 02:21:23,789 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 408 transitions. Word has length 72 [2019-11-26 02:21:23,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:23,790 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 408 transitions. [2019-11-26 02:21:23,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:21:23,790 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 408 transitions. [2019-11-26 02:21:23,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-26 02:21:23,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:23,791 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, 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:21:23,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:21:23,996 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:23,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:23,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1140369447, now seen corresponding path program 1 times [2019-11-26 02:21:23,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:23,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811185655] [2019-11-26 02:21:23,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:21:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:21:24,293 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:21:24,294 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:21:24,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:21:24 BoogieIcfgContainer [2019-11-26 02:21:24,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:21:24,402 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:21:24,402 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:21:24,402 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:21:24,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:21:14" (3/4) ... [2019-11-26 02:21:24,405 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-26 02:21:24,405 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:21:24,407 INFO L168 Benchmark]: Toolchain (without parser) took 13659.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.1 MB). Free memory was 946.1 MB in the beginning and 814.0 MB in the end (delta: 132.1 MB). Peak memory consumption was 425.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:21:24,408 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:21:24,411 INFO L168 Benchmark]: CACSL2BoogieTranslator took 940.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -148.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:21:24,411 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:21:24,411 INFO L168 Benchmark]: Boogie Preprocessor took 151.60 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:21:24,412 INFO L168 Benchmark]: RCFGBuilder took 2402.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 919.4 MB in the end (delta: 167.9 MB). Peak memory consumption was 167.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:21:24,412 INFO L168 Benchmark]: TraceAbstraction took 10025.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 919.4 MB in the beginning and 814.0 MB in the end (delta: 105.4 MB). Peak memory consumption was 270.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:21:24,413 INFO L168 Benchmark]: Witness Printer took 3.93 ms. Allocated memory is still 1.3 GB. Free memory is still 814.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:21:24,416 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 940.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -148.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 130.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 151.60 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2402.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 919.4 MB in the end (delta: 167.9 MB). Peak memory consumption was 167.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10025.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 919.4 MB in the beginning and 814.0 MB in the end (delta: 105.4 MB). Peak memory consumption was 270.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.93 ms. Allocated memory is still 1.3 GB. Free memory is still 814.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1702]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback [L1115] COND FALSE !((unsigned long )s->info_callback != (unsigned long )((void *)0)) [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={5:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={5:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={5:0}] [L1351] COND FALSE !(ret <= 0) [L1356] s->hit [L1356] COND TRUE s->hit [L1357] s->state = 8656 [L1361] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1229] COND TRUE s->state == 8656 [L1554] EXPR s->session [L1554] EXPR s->s3 [L1554] EXPR (s->s3)->tmp.new_cipher [L1554] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1555] COND FALSE !(! tmp___9) [L1561] ret = __VERIFIER_nondet_int() [L1562] COND TRUE blastFlag == 2 [L1563] blastFlag = 3 VAL [init=1, SSLv3_server_data={5:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={5:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={5:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Result: UNSAFE, OverallTime: 9.9s, OverallIterations: 21, TraceHistogramMax: 4, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2804 SDtfs, 562 SDslu, 4255 SDs, 0 SdLazy, 2485 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 168 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=284occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 211 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1355 NumberOfCodeBlocks, 1355 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1294 ConstructedInterpolants, 0 QuantifiedInterpolants, 172202 SizeOfPredicates, 1 NumberOfNonLiveVariables, 423 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 301/373 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:21:26,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:21:26,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:21:26,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:21:26,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:21:26,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:21:26,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:21:26,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:21:26,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:21:26,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:21:26,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:21:26,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:21:26,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:21:26,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:21:26,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:21:26,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:21:26,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:21:26,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:21:26,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:21:26,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:21:26,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:21:26,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:21:26,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:21:26,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:21:26,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:21:26,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:21:26,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:21:26,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:21:26,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:21:26,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:21:26,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:21:26,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:21:26,270 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:21:26,271 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:21:26,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:21:26,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:21:26,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:21:26,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:21:26,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:21:26,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:21:26,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:21:26,278 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-11-26 02:21:26,306 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:21:26,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:21:26,307 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:21:26,307 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:21:26,307 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:21:26,308 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:21:26,308 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:21:26,308 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:21:26,308 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:21:26,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:21:26,309 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:21:26,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:21:26,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:21:26,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:21:26,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:21:26,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:21:26,311 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:21:26,311 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:21:26,311 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:21:26,311 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:21:26,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:21:26,312 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:21:26,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:21:26,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:21:26,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:21:26,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:21:26,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:21:26,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:21:26,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:21:26,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:21:26,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:21:26,314 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:21:26,315 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:21:26,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:21:26,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:21:26,315 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_89e44c70-abba-43a0-8ff6-8407ce682619/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 -> 1952eae46575e60399f761afaedbe356b8f81a96 [2019-11-26 02:21:26,587 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:21:26,603 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:21:26,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:21:26,607 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:21:26,607 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:21:26,608 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-11-26 02:21:26,666 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/data/6b9e0b7f8/5a6597d288034d30b671233dc16d2028/FLAGbf776722a [2019-11-26 02:21:27,207 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:21:27,208 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-11-26 02:21:27,236 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/data/6b9e0b7f8/5a6597d288034d30b671233dc16d2028/FLAGbf776722a [2019-11-26 02:21:27,676 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_89e44c70-abba-43a0-8ff6-8407ce682619/bin/utaipan/data/6b9e0b7f8/5a6597d288034d30b671233dc16d2028 [2019-11-26 02:21:27,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:21:27,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:21:27,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:21:27,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:21:27,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:21:27,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:21:27" (1/1) ... [2019-11-26 02:21:27,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c85bffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:27, skipping insertion in model container [2019-11-26 02:21:27,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:21:27" (1/1) ... [2019-11-26 02:21:27,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:21:27,780 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:21:28,199 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:21:28,200 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-26 02:21:28,200 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:21:28,223 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:21:28,228 INFO L168 Benchmark]: Toolchain (without parser) took 547.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -122.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:21:28,229 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:21:28,230 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -122.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:21:28,231 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 544.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -122.4 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...