./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ef90d761-8b7a-4c69-bd47-9f0a1f7df7aa/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ef90d761-8b7a-4c69-bd47-9f0a1f7df7aa/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ef90d761-8b7a-4c69-bd47-9f0a1f7df7aa/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ef90d761-8b7a-4c69-bd47-9f0a1f7df7aa/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ef90d761-8b7a-4c69-bd47-9f0a1f7df7aa/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ef90d761-8b7a-4c69-bd47-9f0a1f7df7aa/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 99a77f5372e1d3174eb539425b8da52ff3b34c76 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:47:31,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:47:31,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:47:31,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:47:31,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:47:31,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:47:31,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:47:31,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:47:31,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:47:31,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:47:31,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:47:31,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:47:31,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:47:31,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:47:31,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:47:31,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:47:31,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:47:31,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:47:31,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:47:31,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:47:31,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:47:31,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:47:31,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:47:31,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:47:31,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:47:31,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:47:31,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:47:31,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:47:31,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:47:31,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:47:31,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:47:31,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:47:31,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:47:31,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:47:31,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:47:31,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:47:31,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:47:31,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:47:31,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:47:31,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:47:31,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:47:31,810 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ef90d761-8b7a-4c69-bd47-9f0a1f7df7aa/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:47:31,820 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:47:31,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:47:31,821 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:47:31,821 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:47:31,821 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:47:31,821 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:47:31,821 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:47:31,821 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:47:31,821 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:47:31,821 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:47:31,821 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:47:31,822 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:47:31,822 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:47:31,822 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:47:31,822 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:47:31,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:47:31,822 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:47:31,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:47:31,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:47:31,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:47:31,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:47:31,823 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:47:31,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:47:31,823 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:47:31,823 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:47:31,823 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:47:31,824 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:47:31,824 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:47:31,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:47:31,824 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:47:31,824 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:47:31,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:47:31,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:47:31,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:47:31,825 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:47:31,825 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:47:31,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:47:31,825 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:47:31,825 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:47:31,825 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:47:31,825 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_ef90d761-8b7a-4c69-bd47-9f0a1f7df7aa/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 -> 99a77f5372e1d3174eb539425b8da52ff3b34c76 [2019-12-07 20:47:31,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:47:31,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:47:31,936 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:47:31,937 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:47:31,938 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:47:31,938 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ef90d761-8b7a-4c69-bd47-9f0a1f7df7aa/bin/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-12-07 20:47:31,975 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ef90d761-8b7a-4c69-bd47-9f0a1f7df7aa/bin/utaipan/data/a7b73bbeb/a631631daa7e4d1d814176b21e43b1c4/FLAG5ae95c071 [2019-12-07 20:47:32,435 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:47:32,436 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ef90d761-8b7a-4c69-bd47-9f0a1f7df7aa/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-12-07 20:47:32,445 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ef90d761-8b7a-4c69-bd47-9f0a1f7df7aa/bin/utaipan/data/a7b73bbeb/a631631daa7e4d1d814176b21e43b1c4/FLAG5ae95c071 [2019-12-07 20:47:32,454 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ef90d761-8b7a-4c69-bd47-9f0a1f7df7aa/bin/utaipan/data/a7b73bbeb/a631631daa7e4d1d814176b21e43b1c4 [2019-12-07 20:47:32,456 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:47:32,457 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:47:32,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:47:32,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:47:32,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:47:32,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:47:32" (1/1) ... [2019-12-07 20:47:32,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9de8399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:32, skipping insertion in model container [2019-12-07 20:47:32,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:47:32" (1/1) ... [2019-12-07 20:47:32,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:47:32,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:47:32,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:47:32,684 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:47:32,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:47:32,738 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:47:32,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:32 WrapperNode [2019-12-07 20:47:32,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:47:32,739 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:47:32,739 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:47:32,739 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:47:32,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:32" (1/1) ... [2019-12-07 20:47:32,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:32" (1/1) ... [2019-12-07 20:47:32,789 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:47:32,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:47:32,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:47:32,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:47:32,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:32" (1/1) ... [2019-12-07 20:47:32,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:32" (1/1) ... [2019-12-07 20:47:32,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:32" (1/1) ... [2019-12-07 20:47:32,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:32" (1/1) ... [2019-12-07 20:47:32,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:32" (1/1) ... [2019-12-07 20:47:32,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:32" (1/1) ... [2019-12-07 20:47:32,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:32" (1/1) ... [2019-12-07 20:47:32,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:47:32,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:47:32,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:47:32,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:47:32,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef90d761-8b7a-4c69-bd47-9f0a1f7df7aa/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:47:32,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:47:32,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:47:32,982 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 20:47:32,989 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 20:47:32,998 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 20:47:33,005 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 20:47:33,011 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 20:47:33,015 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 20:47:33,020 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 20:47:33,025 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 20:47:33,031 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 20:47:33,034 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 20:47:33,036 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 20:47:33,041 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 20:47:33,497 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-12-07 20:47:33,497 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-12-07 20:47:33,497 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-12-07 20:47:33,497 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-12-07 20:47:33,497 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2019-12-07 20:47:33,497 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2019-12-07 20:47:33,497 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-12-07 20:47:33,497 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-12-07 20:47:33,498 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2019-12-07 20:47:33,498 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2019-12-07 20:47:33,498 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-12-07 20:47:33,498 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-12-07 20:47:33,498 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2019-12-07 20:47:33,498 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2019-12-07 20:47:33,498 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2019-12-07 20:47:33,498 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2019-12-07 20:47:33,498 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2019-12-07 20:47:33,499 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2019-12-07 20:47:33,499 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2019-12-07 20:47:33,499 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2019-12-07 20:47:33,499 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-12-07 20:47:33,499 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-12-07 20:47:33,499 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2019-12-07 20:47:33,499 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2019-12-07 20:47:33,996 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:47:33,996 INFO L287 CfgBuilder]: Removed 154 assume(true) statements. [2019-12-07 20:47:33,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:47:33 BoogieIcfgContainer [2019-12-07 20:47:33,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:47:33,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:47:33,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:47:33,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:47:34,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:47:32" (1/3) ... [2019-12-07 20:47:34,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34207f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:47:34, skipping insertion in model container [2019-12-07 20:47:34,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:47:32" (2/3) ... [2019-12-07 20:47:34,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34207f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:47:34, skipping insertion in model container [2019-12-07 20:47:34,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:47:33" (3/3) ... [2019-12-07 20:47:34,002 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2019-12-07 20:47:34,008 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:47:34,013 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2019-12-07 20:47:34,021 INFO L249 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2019-12-07 20:47:34,038 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:47:34,038 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:47:34,038 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:47:34,038 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:47:34,038 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:47:34,038 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:47:34,038 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:47:34,039 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:47:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states. [2019-12-07 20:47:34,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:47:34,060 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:34,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:47:34,061 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:34,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:34,065 INFO L82 PathProgramCache]: Analyzing trace with hash 334546970, now seen corresponding path program 1 times [2019-12-07 20:47:34,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:34,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509071697] [2019-12-07 20:47:34,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:34,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:34,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509071697] [2019-12-07 20:47:34,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:34,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:47:34,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682132049] [2019-12-07 20:47:34,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:47:34,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:34,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:47:34,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:34,204 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 3 states. [2019-12-07 20:47:34,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:34,346 INFO L93 Difference]: Finished difference Result 357 states and 532 transitions. [2019-12-07 20:47:34,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:47:34,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 20:47:34,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:34,357 INFO L225 Difference]: With dead ends: 357 [2019-12-07 20:47:34,357 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 20:47:34,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 20:47:34,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-12-07 20:47:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-12-07 20:47:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 245 transitions. [2019-12-07 20:47:34,404 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 245 transitions. Word has length 9 [2019-12-07 20:47:34,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:34,405 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 245 transitions. [2019-12-07 20:47:34,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:47:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 245 transitions. [2019-12-07 20:47:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:47:34,406 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:34,406 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:47:34,407 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:34,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:34,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1345803039, now seen corresponding path program 1 times [2019-12-07 20:47:34,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:34,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335471432] [2019-12-07 20:47:34,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:34,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335471432] [2019-12-07 20:47:34,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:34,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:47:34,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345510622] [2019-12-07 20:47:34,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:47:34,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:34,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:47:34,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:34,450 INFO L87 Difference]: Start difference. First operand 184 states and 245 transitions. Second operand 3 states. [2019-12-07 20:47:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:34,488 INFO L93 Difference]: Finished difference Result 288 states and 373 transitions. [2019-12-07 20:47:34,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:47:34,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 20:47:34,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:34,490 INFO L225 Difference]: With dead ends: 288 [2019-12-07 20:47:34,491 INFO L226 Difference]: Without dead ends: 190 [2019-12-07 20:47:34,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-07 20:47:34,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 154. [2019-12-07 20:47:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 20:47:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 201 transitions. [2019-12-07 20:47:34,506 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 201 transitions. Word has length 10 [2019-12-07 20:47:34,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:34,506 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 201 transitions. [2019-12-07 20:47:34,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:47:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 201 transitions. [2019-12-07 20:47:34,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:47:34,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:34,508 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:47:34,508 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:34,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:34,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1906729073, now seen corresponding path program 1 times [2019-12-07 20:47:34,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:34,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243236260] [2019-12-07 20:47:34,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:34,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243236260] [2019-12-07 20:47:34,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:34,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:47:34,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065020521] [2019-12-07 20:47:34,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:47:34,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:34,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:47:34,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:34,531 INFO L87 Difference]: Start difference. First operand 154 states and 201 transitions. Second operand 3 states. [2019-12-07 20:47:34,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:34,548 INFO L93 Difference]: Finished difference Result 171 states and 221 transitions. [2019-12-07 20:47:34,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:47:34,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 20:47:34,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:34,550 INFO L225 Difference]: With dead ends: 171 [2019-12-07 20:47:34,550 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 20:47:34,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:34,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 20:47:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-12-07 20:47:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 20:47:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 200 transitions. [2019-12-07 20:47:34,561 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 200 transitions. Word has length 10 [2019-12-07 20:47:34,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:34,561 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 200 transitions. [2019-12-07 20:47:34,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:47:34,562 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 200 transitions. [2019-12-07 20:47:34,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:47:34,563 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:34,563 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:47:34,564 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:34,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:34,564 INFO L82 PathProgramCache]: Analyzing trace with hash -107456817, now seen corresponding path program 1 times [2019-12-07 20:47:34,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:34,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170417602] [2019-12-07 20:47:34,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:34,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170417602] [2019-12-07 20:47:34,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:34,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:47:34,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137813612] [2019-12-07 20:47:34,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:47:34,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:34,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:47:34,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:34,597 INFO L87 Difference]: Start difference. First operand 154 states and 200 transitions. Second operand 3 states. [2019-12-07 20:47:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:34,682 INFO L93 Difference]: Finished difference Result 154 states and 200 transitions. [2019-12-07 20:47:34,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:47:34,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 20:47:34,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:34,683 INFO L225 Difference]: With dead ends: 154 [2019-12-07 20:47:34,683 INFO L226 Difference]: Without dead ends: 140 [2019-12-07 20:47:34,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:34,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-07 20:47:34,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-12-07 20:47:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-12-07 20:47:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 186 transitions. [2019-12-07 20:47:34,692 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 186 transitions. Word has length 15 [2019-12-07 20:47:34,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:34,692 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 186 transitions. [2019-12-07 20:47:34,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:47:34,693 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 186 transitions. [2019-12-07 20:47:34,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:47:34,694 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:34,694 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:47:34,694 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:34,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:34,695 INFO L82 PathProgramCache]: Analyzing trace with hash -231494050, now seen corresponding path program 1 times [2019-12-07 20:47:34,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:34,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970238343] [2019-12-07 20:47:34,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:34,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:34,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970238343] [2019-12-07 20:47:34,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:34,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:47:34,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256378671] [2019-12-07 20:47:34,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:47:34,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:34,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:47:34,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:34,726 INFO L87 Difference]: Start difference. First operand 140 states and 186 transitions. Second operand 3 states. [2019-12-07 20:47:34,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:34,739 INFO L93 Difference]: Finished difference Result 194 states and 250 transitions. [2019-12-07 20:47:34,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:47:34,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 20:47:34,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:34,741 INFO L225 Difference]: With dead ends: 194 [2019-12-07 20:47:34,741 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 20:47:34,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:34,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 20:47:34,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 140. [2019-12-07 20:47:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-12-07 20:47:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 185 transitions. [2019-12-07 20:47:34,747 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 185 transitions. Word has length 18 [2019-12-07 20:47:34,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:34,747 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 185 transitions. [2019-12-07 20:47:34,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:47:34,747 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 185 transitions. [2019-12-07 20:47:34,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:47:34,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:34,748 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:47:34,749 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:34,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:34,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1811817549, now seen corresponding path program 1 times [2019-12-07 20:47:34,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:34,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096206665] [2019-12-07 20:47:34,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:34,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096206665] [2019-12-07 20:47:34,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:34,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:47:34,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664417712] [2019-12-07 20:47:34,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:47:34,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:34,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:47:34,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:34,774 INFO L87 Difference]: Start difference. First operand 140 states and 185 transitions. Second operand 3 states. [2019-12-07 20:47:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:34,828 INFO L93 Difference]: Finished difference Result 174 states and 226 transitions. [2019-12-07 20:47:34,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:47:34,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 20:47:34,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:34,829 INFO L225 Difference]: With dead ends: 174 [2019-12-07 20:47:34,829 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 20:47:34,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:34,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 20:47:34,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-12-07 20:47:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-12-07 20:47:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 181 transitions. [2019-12-07 20:47:34,835 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 181 transitions. Word has length 18 [2019-12-07 20:47:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:34,836 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 181 transitions. [2019-12-07 20:47:34,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:47:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 181 transitions. [2019-12-07 20:47:34,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 20:47:34,837 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:34,837 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:47:34,837 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:34,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:34,838 INFO L82 PathProgramCache]: Analyzing trace with hash -200722242, now seen corresponding path program 1 times [2019-12-07 20:47:34,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:34,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895355662] [2019-12-07 20:47:34,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:34,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895355662] [2019-12-07 20:47:34,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:34,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:47:34,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275858562] [2019-12-07 20:47:34,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:47:34,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:34,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:47:34,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:34,883 INFO L87 Difference]: Start difference. First operand 137 states and 181 transitions. Second operand 3 states. [2019-12-07 20:47:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:34,896 INFO L93 Difference]: Finished difference Result 189 states and 243 transitions. [2019-12-07 20:47:34,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:47:34,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 20:47:34,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:34,897 INFO L225 Difference]: With dead ends: 189 [2019-12-07 20:47:34,897 INFO L226 Difference]: Without dead ends: 153 [2019-12-07 20:47:34,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-12-07 20:47:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 135. [2019-12-07 20:47:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-07 20:47:34,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 178 transitions. [2019-12-07 20:47:34,903 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 178 transitions. Word has length 19 [2019-12-07 20:47:34,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:34,903 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 178 transitions. [2019-12-07 20:47:34,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:47:34,903 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 178 transitions. [2019-12-07 20:47:34,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:47:34,904 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:34,904 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] [2019-12-07 20:47:34,904 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:34,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:34,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1920632013, now seen corresponding path program 1 times [2019-12-07 20:47:34,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:34,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778716510] [2019-12-07 20:47:34,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:34,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778716510] [2019-12-07 20:47:34,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:34,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:47:34,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834592792] [2019-12-07 20:47:34,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:47:34,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:34,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:47:34,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:47:34,941 INFO L87 Difference]: Start difference. First operand 135 states and 178 transitions. Second operand 4 states. [2019-12-07 20:47:35,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:35,018 INFO L93 Difference]: Finished difference Result 169 states and 219 transitions. [2019-12-07 20:47:35,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:47:35,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 20:47:35,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:35,019 INFO L225 Difference]: With dead ends: 169 [2019-12-07 20:47:35,019 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 20:47:35,020 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-12-07 20:47:35,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 20:47:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-12-07 20:47:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-07 20:47:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 177 transitions. [2019-12-07 20:47:35,027 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 177 transitions. Word has length 20 [2019-12-07 20:47:35,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:35,027 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 177 transitions. [2019-12-07 20:47:35,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:47:35,027 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 177 transitions. [2019-12-07 20:47:35,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 20:47:35,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:35,028 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] [2019-12-07 20:47:35,028 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:35,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:35,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1210076498, now seen corresponding path program 1 times [2019-12-07 20:47:35,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:35,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820596352] [2019-12-07 20:47:35,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:35,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820596352] [2019-12-07 20:47:35,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:35,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:47:35,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281018987] [2019-12-07 20:47:35,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:47:35,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:35,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:47:35,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:35,053 INFO L87 Difference]: Start difference. First operand 135 states and 177 transitions. Second operand 3 states. [2019-12-07 20:47:35,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:35,067 INFO L93 Difference]: Finished difference Result 146 states and 191 transitions. [2019-12-07 20:47:35,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:47:35,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 20:47:35,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:35,069 INFO L225 Difference]: With dead ends: 146 [2019-12-07 20:47:35,069 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 20:47:35,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:35,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 20:47:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-12-07 20:47:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 20:47:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 170 transitions. [2019-12-07 20:47:35,076 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 170 transitions. Word has length 21 [2019-12-07 20:47:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:35,077 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 170 transitions. [2019-12-07 20:47:35,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:47:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 170 transitions. [2019-12-07 20:47:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 20:47:35,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:35,078 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] [2019-12-07 20:47:35,078 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:35,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:35,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1330689250, now seen corresponding path program 1 times [2019-12-07 20:47:35,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:35,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631153337] [2019-12-07 20:47:35,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:35,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631153337] [2019-12-07 20:47:35,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:35,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:47:35,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899248662] [2019-12-07 20:47:35,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:47:35,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:35,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:47:35,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:47:35,127 INFO L87 Difference]: Start difference. First operand 130 states and 170 transitions. Second operand 5 states. [2019-12-07 20:47:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:35,258 INFO L93 Difference]: Finished difference Result 154 states and 195 transitions. [2019-12-07 20:47:35,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:47:35,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 20:47:35,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:35,259 INFO L225 Difference]: With dead ends: 154 [2019-12-07 20:47:35,259 INFO L226 Difference]: Without dead ends: 152 [2019-12-07 20:47:35,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:47:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-07 20:47:35,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 130. [2019-12-07 20:47:35,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 20:47:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 170 transitions. [2019-12-07 20:47:35,265 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 170 transitions. Word has length 21 [2019-12-07 20:47:35,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:35,265 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 170 transitions. [2019-12-07 20:47:35,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:47:35,265 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 170 transitions. [2019-12-07 20:47:35,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:47:35,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:35,266 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] [2019-12-07 20:47:35,266 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:35,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:35,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1142712830, now seen corresponding path program 1 times [2019-12-07 20:47:35,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:35,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721272573] [2019-12-07 20:47:35,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:35,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721272573] [2019-12-07 20:47:35,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:35,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:47:35,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353636927] [2019-12-07 20:47:35,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:47:35,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:35,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:47:35,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:47:35,294 INFO L87 Difference]: Start difference. First operand 130 states and 170 transitions. Second operand 5 states. [2019-12-07 20:47:35,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:35,420 INFO L93 Difference]: Finished difference Result 156 states and 196 transitions. [2019-12-07 20:47:35,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:47:35,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 20:47:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:35,421 INFO L225 Difference]: With dead ends: 156 [2019-12-07 20:47:35,421 INFO L226 Difference]: Without dead ends: 151 [2019-12-07 20:47:35,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:47:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-12-07 20:47:35,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2019-12-07 20:47:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-12-07 20:47:35,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 184 transitions. [2019-12-07 20:47:35,429 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 184 transitions. Word has length 22 [2019-12-07 20:47:35,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:35,429 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 184 transitions. [2019-12-07 20:47:35,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:47:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 184 transitions. [2019-12-07 20:47:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:47:35,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:35,430 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] [2019-12-07 20:47:35,430 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:35,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:35,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1764070242, now seen corresponding path program 1 times [2019-12-07 20:47:35,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:35,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926315027] [2019-12-07 20:47:35,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:35,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926315027] [2019-12-07 20:47:35,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:35,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:47:35,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158588861] [2019-12-07 20:47:35,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:47:35,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:35,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:47:35,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:35,446 INFO L87 Difference]: Start difference. First operand 144 states and 184 transitions. Second operand 3 states. [2019-12-07 20:47:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:35,503 INFO L93 Difference]: Finished difference Result 148 states and 189 transitions. [2019-12-07 20:47:35,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:47:35,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 20:47:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:35,504 INFO L225 Difference]: With dead ends: 148 [2019-12-07 20:47:35,504 INFO L226 Difference]: Without dead ends: 146 [2019-12-07 20:47:35,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:35,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-07 20:47:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-12-07 20:47:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 20:47:35,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 187 transitions. [2019-12-07 20:47:35,510 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 187 transitions. Word has length 22 [2019-12-07 20:47:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:35,511 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 187 transitions. [2019-12-07 20:47:35,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:47:35,511 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 187 transitions. [2019-12-07 20:47:35,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 20:47:35,511 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:35,511 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] [2019-12-07 20:47:35,511 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:35,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:35,512 INFO L82 PathProgramCache]: Analyzing trace with hash -76626783, now seen corresponding path program 1 times [2019-12-07 20:47:35,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:35,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702331605] [2019-12-07 20:47:35,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:35,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702331605] [2019-12-07 20:47:35,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:35,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:47:35,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105880015] [2019-12-07 20:47:35,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:47:35,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:35,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:47:35,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:35,527 INFO L87 Difference]: Start difference. First operand 146 states and 187 transitions. Second operand 3 states. [2019-12-07 20:47:35,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:35,583 INFO L93 Difference]: Finished difference Result 160 states and 202 transitions. [2019-12-07 20:47:35,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:47:35,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 20:47:35,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:35,584 INFO L225 Difference]: With dead ends: 160 [2019-12-07 20:47:35,584 INFO L226 Difference]: Without dead ends: 140 [2019-12-07 20:47:35,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:35,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-07 20:47:35,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-12-07 20:47:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-12-07 20:47:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2019-12-07 20:47:35,590 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 23 [2019-12-07 20:47:35,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:35,591 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2019-12-07 20:47:35,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:47:35,591 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2019-12-07 20:47:35,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 20:47:35,591 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:35,591 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] [2019-12-07 20:47:35,591 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:35,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:35,591 INFO L82 PathProgramCache]: Analyzing trace with hash 674304095, now seen corresponding path program 1 times [2019-12-07 20:47:35,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:35,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454559979] [2019-12-07 20:47:35,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:35,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454559979] [2019-12-07 20:47:35,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:35,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:47:35,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544067774] [2019-12-07 20:47:35,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:47:35,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:35,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:47:35,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:47:35,610 INFO L87 Difference]: Start difference. First operand 140 states and 174 transitions. Second operand 4 states. [2019-12-07 20:47:35,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:35,679 INFO L93 Difference]: Finished difference Result 146 states and 179 transitions. [2019-12-07 20:47:35,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:47:35,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 20:47:35,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:35,680 INFO L225 Difference]: With dead ends: 146 [2019-12-07 20:47:35,680 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 20:47:35,681 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-12-07 20:47:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 20:47:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-12-07 20:47:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 20:47:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 153 transitions. [2019-12-07 20:47:35,686 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 153 transitions. Word has length 23 [2019-12-07 20:47:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:35,687 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 153 transitions. [2019-12-07 20:47:35,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:47:35,687 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 153 transitions. [2019-12-07 20:47:35,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 20:47:35,687 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:35,687 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] [2019-12-07 20:47:35,688 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:35,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:35,688 INFO L82 PathProgramCache]: Analyzing trace with hash -877819429, now seen corresponding path program 1 times [2019-12-07 20:47:35,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:35,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634333968] [2019-12-07 20:47:35,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:35,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634333968] [2019-12-07 20:47:35,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:35,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:47:35,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215489738] [2019-12-07 20:47:35,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:47:35,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:35,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:47:35,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:47:35,710 INFO L87 Difference]: Start difference. First operand 126 states and 153 transitions. Second operand 4 states. [2019-12-07 20:47:35,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:35,765 INFO L93 Difference]: Finished difference Result 146 states and 173 transitions. [2019-12-07 20:47:35,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:47:35,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 20:47:35,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:35,766 INFO L225 Difference]: With dead ends: 146 [2019-12-07 20:47:35,766 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 20:47:35,766 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-12-07 20:47:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 20:47:35,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-12-07 20:47:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 20:47:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 146 transitions. [2019-12-07 20:47:35,772 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 146 transitions. Word has length 23 [2019-12-07 20:47:35,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:35,772 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 146 transitions. [2019-12-07 20:47:35,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:47:35,772 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2019-12-07 20:47:35,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 20:47:35,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:35,772 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] [2019-12-07 20:47:35,773 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:35,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:35,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1140738629, now seen corresponding path program 1 times [2019-12-07 20:47:35,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:35,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328458524] [2019-12-07 20:47:35,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:35,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328458524] [2019-12-07 20:47:35,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:35,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:47:35,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240335204] [2019-12-07 20:47:35,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:47:35,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:35,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:47:35,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:35,789 INFO L87 Difference]: Start difference. First operand 126 states and 146 transitions. Second operand 3 states. [2019-12-07 20:47:35,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:35,796 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2019-12-07 20:47:35,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:47:35,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 20:47:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:35,798 INFO L225 Difference]: With dead ends: 131 [2019-12-07 20:47:35,798 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 20:47:35,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:47:35,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 20:47:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-12-07 20:47:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 20:47:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-12-07 20:47:35,804 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 23 [2019-12-07 20:47:35,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:35,804 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-12-07 20:47:35,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:47:35,804 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-12-07 20:47:35,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 20:47:35,804 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:35,804 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] [2019-12-07 20:47:35,804 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:35,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:35,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1856621795, now seen corresponding path program 1 times [2019-12-07 20:47:35,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:35,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580463747] [2019-12-07 20:47:35,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:35,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580463747] [2019-12-07 20:47:35,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:35,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:47:35,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811149956] [2019-12-07 20:47:35,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:47:35,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:35,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:47:35,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:47:35,829 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 4 states. [2019-12-07 20:47:35,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:35,866 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2019-12-07 20:47:35,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:47:35,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 20:47:35,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:35,868 INFO L225 Difference]: With dead ends: 132 [2019-12-07 20:47:35,868 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 20:47:35,868 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-12-07 20:47:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 20:47:35,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-12-07 20:47:35,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 20:47:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2019-12-07 20:47:35,876 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 24 [2019-12-07 20:47:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:35,877 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2019-12-07 20:47:35,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:47:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2019-12-07 20:47:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 20:47:35,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:35,877 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] [2019-12-07 20:47:35,877 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:35,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:35,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1426253951, now seen corresponding path program 1 times [2019-12-07 20:47:35,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:35,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571808056] [2019-12-07 20:47:35,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:35,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571808056] [2019-12-07 20:47:35,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:35,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:47:35,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97192987] [2019-12-07 20:47:35,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:47:35,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:35,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:47:35,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:47:35,899 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 4 states. [2019-12-07 20:47:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:35,963 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2019-12-07 20:47:35,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:47:35,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 20:47:35,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:35,964 INFO L225 Difference]: With dead ends: 124 [2019-12-07 20:47:35,965 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 20:47:35,965 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-12-07 20:47:35,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 20:47:35,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-12-07 20:47:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 20:47:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2019-12-07 20:47:35,973 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 24 [2019-12-07 20:47:35,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:35,973 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2019-12-07 20:47:35,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:47:35,973 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2019-12-07 20:47:35,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 20:47:35,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:35,974 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] [2019-12-07 20:47:35,974 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:35,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:35,974 INFO L82 PathProgramCache]: Analyzing trace with hash -165613475, now seen corresponding path program 1 times [2019-12-07 20:47:35,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:35,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604543362] [2019-12-07 20:47:35,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:36,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604543362] [2019-12-07 20:47:36,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:36,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:47:36,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821818013] [2019-12-07 20:47:36,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:47:36,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:36,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:47:36,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:47:36,004 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 4 states. [2019-12-07 20:47:36,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:36,037 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2019-12-07 20:47:36,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:47:36,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 20:47:36,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:36,037 INFO L225 Difference]: With dead ends: 87 [2019-12-07 20:47:36,037 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 20:47:36,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:47:36,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 20:47:36,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-12-07 20:47:36,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 20:47:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2019-12-07 20:47:36,042 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 25 [2019-12-07 20:47:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:36,043 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-12-07 20:47:36,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:47:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2019-12-07 20:47:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 20:47:36,043 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:36,043 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] [2019-12-07 20:47:36,044 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:36,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:36,044 INFO L82 PathProgramCache]: Analyzing trace with hash 878232028, now seen corresponding path program 1 times [2019-12-07 20:47:36,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:36,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513711390] [2019-12-07 20:47:36,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:47:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:47:36,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513711390] [2019-12-07 20:47:36,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:47:36,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:47:36,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101618443] [2019-12-07 20:47:36,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:47:36,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:47:36,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:47:36,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:47:36,066 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 5 states. [2019-12-07 20:47:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:47:36,116 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2019-12-07 20:47:36,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:47:36,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 20:47:36,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:47:36,117 INFO L225 Difference]: With dead ends: 80 [2019-12-07 20:47:36,117 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 20:47:36,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:47:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 20:47:36,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-07 20:47:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 20:47:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2019-12-07 20:47:36,121 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 26 [2019-12-07 20:47:36,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:47:36,121 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-12-07 20:47:36,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:47:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2019-12-07 20:47:36,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:47:36,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:47:36,122 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] [2019-12-07 20:47:36,122 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:47:36,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:47:36,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1669883762, now seen corresponding path program 1 times [2019-12-07 20:47:36,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:47:36,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519226357] [2019-12-07 20:47:36,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:47:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:47:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:47:36,161 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:47:36,161 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:47:36,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:47:36 BoogieIcfgContainer [2019-12-07 20:47:36,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:47:36,209 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:47:36,209 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:47:36,209 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:47:36,210 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:47:33" (3/4) ... [2019-12-07 20:47:36,211 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:47:36,284 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ef90d761-8b7a-4c69-bd47-9f0a1f7df7aa/bin/utaipan/witness.graphml [2019-12-07 20:47:36,284 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:47:36,286 INFO L168 Benchmark]: Toolchain (without parser) took 3829.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 942.0 MB in the beginning and 1.3 GB in the end (delta: -354.0 MB). Peak memory consumption was 389.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:47:36,286 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:47:36,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:47:36,287 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.99 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:47:36,287 INFO L168 Benchmark]: Boogie Preprocessor took 41.81 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:47:36,287 INFO L168 Benchmark]: RCFGBuilder took 1165.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 869.0 MB in the end (delta: 238.5 MB). Peak memory consumption was 238.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:47:36,287 INFO L168 Benchmark]: TraceAbstraction took 2211.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.0 MB). Free memory was 869.0 MB in the beginning and 780.0 MB in the end (delta: 89.0 MB). Peak memory consumption was 186.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:47:36,288 INFO L168 Benchmark]: Witness Printer took 75.50 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 81.3 MB). Free memory was 780.0 MB in the beginning and 1.3 GB in the end (delta: -516.0 MB). Peak memory consumption was 330.3 kB. Max. memory is 11.5 GB. [2019-12-07 20:47:36,289 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 281.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.99 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.81 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1165.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 869.0 MB in the end (delta: 238.5 MB). Peak memory consumption was 238.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2211.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.0 MB). Free memory was 869.0 MB in the beginning and 780.0 MB in the end (delta: 89.0 MB). Peak memory consumption was 186.0 MB. Max. memory is 11.5 GB. * Witness Printer took 75.50 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 81.3 MB). Free memory was 780.0 MB in the beginning and 1.3 GB in the end (delta: -516.0 MB). Peak memory consumption was 330.3 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1011]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L21] int KernelMode ; [L22] int Executive ; [L23] int DevicePowerState ; [L24] int s ; [L25] int UNLOADED ; [L26] int NP ; [L27] int DC ; [L28] int SKIP1 ; [L29] int SKIP2 ; [L30] int MPR1 ; [L31] int MPR3 ; [L32] int IPC ; [L33] int pended ; [L34] int compFptr ; [L35] int compRegistered ; [L36] int lowerDriverReturn ; [L37] int setEventCalled ; [L38] int customIrp ; [L39] int myStatus ; [L292] int status ; [L293] int irp = __VERIFIER_nondet_int() ; [L294] int pirp ; [L295] int pirp__IoStatus__Status ; [L296] int irp_choice = __VERIFIER_nondet_int() ; [L297] int devobj = __VERIFIER_nondet_int() ; [L298] int __cil_tmp8 ; [L300] KernelMode = 0 [L301] Executive = 0 [L302] DevicePowerState = 1 [L303] s = 0 [L304] UNLOADED = 0 [L305] NP = 0 [L306] DC = 0 [L307] SKIP1 = 0 [L308] SKIP2 = 0 [L309] MPR1 = 0 [L310] MPR3 = 0 [L311] IPC = 0 [L312] pended = 0 [L313] compFptr = 0 [L314] compRegistered = 0 [L315] lowerDriverReturn = 0 [L316] setEventCalled = 0 [L317] customIrp = 0 [L318] myStatus = 0 [L322] status = 0 [L323] pirp = irp [L59] UNLOADED = 0 [L60] NP = 1 [L61] DC = 2 [L62] SKIP1 = 3 [L63] SKIP2 = 4 [L64] MPR1 = 5 [L65] MPR3 = 6 [L66] IPC = 7 [L67] s = UNLOADED [L68] pended = 0 [L69] compFptr = 0 [L70] compRegistered = 0 [L71] lowerDriverReturn = 0 [L72] setEventCalled = 0 [L73] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L326] COND TRUE status >= 0 [L327] s = NP [L328] customIrp = 0 [L329] setEventCalled = customIrp [L330] lowerDriverReturn = setEventCalled [L331] compRegistered = lowerDriverReturn [L332] pended = compRegistered [L333] pirp__IoStatus__Status = 0 [L334] myStatus = 0 [L335] COND FALSE !(irp_choice == 0) [L45] s = NP [L46] pended = 0 [L47] compFptr = 0 [L48] compRegistered = 0 [L49] lowerDriverReturn = 0 [L50] setEventCalled = 0 [L51] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L343] COND FALSE !(status < 0) [L347] int tmp_ndt_1; [L348] tmp_ndt_1 = __VERIFIER_nondet_int() [L349] COND FALSE !(tmp_ndt_1 == 0) [L352] int tmp_ndt_2; [L353] tmp_ndt_2 = __VERIFIER_nondet_int() [L354] COND FALSE !(tmp_ndt_2 == 1) [L357] int tmp_ndt_3; [L358] tmp_ndt_3 = __VERIFIER_nondet_int() [L359] COND TRUE tmp_ndt_3 == 3 [L78] int devExt ; [L79] int irpStack ; [L80] int status ; [L81] int event = __VERIFIER_nondet_int() ; [L82] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L83] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L84] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L85] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L86] int devExt__Started ; [L87] int devExt__Removed ; [L88] int devExt__SurpriseRemoved ; [L89] int Irp__IoStatus__Status ; [L90] int Irp__IoStatus__Information ; [L91] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L92] int irpSp ; [L93] int nextIrpSp ; [L94] int nextIrpSp__Control ; [L95] int irpSp___0 ; [L96] int irpSp__Context ; [L97] int irpSp__Control ; [L98] long __cil_tmp23 ; [L101] status = 0 [L102] devExt = DeviceObject__DeviceExtension [L103] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L104] COND FALSE !(irpStack__MinorFunction == 0) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L107] COND FALSE !(irpStack__MinorFunction == 23) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L110] COND TRUE irpStack__MinorFunction == 2 [L234] devExt__Removed = 1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L235] COND TRUE s == NP [L236] s = SKIP1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L243] Irp__CurrentLocation ++ [L244] Irp__Tail__Overlay__CurrentStackLocation ++ [L481] int returnVal2 ; [L482] int compRetStatus ; [L483] int lcontext = __VERIFIER_nondet_int() ; [L484] long long __cil_tmp7 ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L487] COND FALSE !(\read(compRegistered)) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L500] int tmp_ndt_6; [L501] tmp_ndt_6 = __VERIFIER_nondet_int() [L502] COND FALSE !(tmp_ndt_6 == 0) [L505] int tmp_ndt_7; [L506] tmp_ndt_7 = __VERIFIER_nondet_int() [L507] COND FALSE !(tmp_ndt_7 == 1) [L519] returnVal2 = 259 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L526] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L530] COND FALSE !(s == MPR1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L539] COND TRUE s == SKIP1 [L540] s = SKIP2 [L541] lowerDriverReturn = returnVal2 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L549] return (returnVal2); [L246] status = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L288] return (status); [L386] status = KbFilter_PnP(devobj, pirp) [L410] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L418] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L426] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L427] COND TRUE status != -1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L428] COND FALSE !(s != SKIP2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L438] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L445] COND FALSE !(s == DC) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L450] COND TRUE status != lowerDriverReturn VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L1011] __VERIFIER_error() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=259, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 202 locations, 30 error locations. Result: UNSAFE, OverallTime: 2.1s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3019 SDtfs, 1792 SDslu, 2142 SDs, 0 SdLazy, 1151 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 101 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 423 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 376 ConstructedInterpolants, 0 QuantifiedInterpolants, 17227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...